5606 search results - page 532 / 1122 » Randomization Techniques for Graphs. |
185
click to vote
SARA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
213
click to vote
INFOCOM
2005
IEEE
16 years 24 days ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
184
click to vote
DCG
2006
15 years 7 months ago
2006
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...
214
click to vote
GLOBECOM
2010
IEEE
15 years 5 months ago
2010
IEEE
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
154
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
While many clever techniques have been proposed for visual analysis, most of these are “one of” and it is not easy to see how to combine multiple techniques. We propose an alg...