4117 search results - page 216 / 824 » On the Satisfiability of Complex Constraints |
196
click to vote
DEBS
2009
ACM
15 years 10 months ago
2009
ACM
The ability to find services or resources that satisfy some criteria is an important aspect of distributed systems. This paper presents an event-based architecture to support more...
164
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
201
click to vote
NIPS
2004
15 years 8 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
169
click to vote
SIAMJO
2010
15 years 1 months ago
2010
Necessary first-order sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. These conditions are sati...
165
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....