2323 search results - page 371 / 465 » Power optimization for connectivity problems |
169
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
185
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
205
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
143
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
HyperNEAT represents a class of neuroevolutionary algorithms that captures some of the power of natural development with a ionally efficient high-level abstraction of development....
155
click to vote
ESWS
2009
Springer
16 years 26 days ago
2009
Springer
Despite serious research efforts, automatic ontology matching still suffers from severe problems with respect to the quality of matching results. Existing matching systems trade-of...