3422 search results - page 108 / 685 » Random Subset Optimization |
118
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
134
Voted
SPAA
2009
ACM
15 years 11 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
119
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
140
Voted
CHES
2005
Springer
15 years 8 months ago
2005
Springer
Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms us...
93
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...