1729 search results - page 254 / 346 » Bound Graph Polysemy |
144
Voted
AAAI
2010
15 years 6 months ago
2010
We study propagation algorithms for the conjunction of two ALLDIFFERENT constraints. Solutions of an ALLDIFFERENT constraint can be seen as perfect matchings on the variable/value...
175
click to vote
AIPS
2006
15 years 6 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
166
Voted
OPODIS
2004
15 years 6 months ago
2004
A localized Delaunay triangulation owns the following interesting properties in a wireless ad hoc setting: it can be built with localized information, the communication cost impos...
138
Voted
CCCG
1997
15 years 6 months ago
1997
In this paper we prove that for any simple polygon P with n vertices, the sum of the number of strictly internal edges and the number of strictly external visibility edges of P is...
149
Voted
AI
2008
Springer
15 years 5 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...