Sciweavers

3020 search results - page 271 / 604
» Optimal partition trees
Sort
View
TON
2008
159views more  TON 2008»
15 years 6 months ago
Optimizing lifetime for continuous data aggregation with precision guarantees in wireless sensor networks
This paper exploits the tradeoff between data quality and energy consumption to extend the lifetime of wireless sensor networks. To obtain an aggregate form of sensor data with pre...
Xueyan Tang, Jianliang Xu
204
Voted
CEC
2008
IEEE
16 years 1 months ago
Geometric PSO + GP = Particle Swarm Programming
—Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both conti...
Julian Togelius, Renzo De Nardi, Alberto Moraglio
DAWAK
2003
Springer
15 years 12 months ago
Computing SQL Queries with Boolean Aggregates
We introduce a new method for optimization of SQL queries with nested subqueries. The method is based on the idea of Boolean aggregates, aggregates that compute the conjunction or ...
Antonio Badia
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
15 years 6 months ago
On Bipartite Drawings and the Linear Arrangement Problem
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
Farhad Shahrokhi, Ondrej Sýkora, Lás...
ESA
2011
Springer
269views Algorithms» more  ESA 2011»
14 years 6 months ago
Alphabet-Independent Compressed Text Indexing
Self-indexes can represent a text in asymptotically optimal space under the k-th order entropy model, give access to text substrings, and support indexed pattern searches. Their ti...
Djamal Belazzougui, Gonzalo Navarro