5606 search results - page 571 / 1122 » Randomization Techniques for Graphs. |
349
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
224
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
202
click to vote
COMPLEX
2009
Springer
16 years 1 months ago
2009
Springer
We derive variational equations to analyze the stability of synchronization for coupled near-identical oscillators. To study the effect of parameter mismatch on the stability in a ...
184
click to vote
IROS
2007
IEEE
16 years 1 months ago
2007
IEEE
— Intention recognition is an important topic in human-robot cooperation that can be tackled using probabilistic model-based methods. A popular instance of such methods are Bayes...
182
click to vote
WEA
2007
Springer
16 years 1 months ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...