202 search results - page 21 / 41 » Locally identifying coloring of graphs |
108
click to vote
IJCAI
2003
15 years 1 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
IDEAL
2003
Springer
15 years 5 months ago
2003
Springer
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...
113
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
124
click to vote
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
—Localizability of network or node is an important subproblem in sensor localization. While rigidity theory plays an important role in identifying several localizability conditio...
101
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Knowing accurate positions of nodes in wireless ad-hoc and sensor networks is essential for a wide range of pervasive and mobile applications. However, errors are inevitable in ...