15073 search results - page 10 / 3015 » Probabilistic algorithms for computing resultants |
166
click to vote
ADHOC
2006
15 years 5 months ago
2006
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
121
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
153
Voted
COCO
2007
Springer
15 years 8 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
142
click to vote
IPSN
2005
Springer
15 years 10 months ago
2005
Springer
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
257
click to vote
LSSC
2007
Springer
15 years 11 months ago
2007
Springer
The Ant Colony Optimization (ACO) algorithms are being applied successfully to a wide range of problems. ACO algorithms could be good alternatives to existing algorithms for hard c...