5115 search results - page 1001 / 1023 » On Randomized Lanczos Algorithms |
CP
2006
Springer
14 years 6 days ago
2006
Springer
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
DCOSS
2006
Springer
14 years 5 days ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
DCOSS
2006
Springer
14 years 5 days ago
2006
Springer
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
PPSN
2000
Springer
14 years 2 days ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
FOCS
1995
IEEE
14 years 1 days ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...