2109 search results - page 75 / 422 » Solving Necklace Constraint Problems |
175
click to vote
ACST
2006
15 years 6 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
125
Voted
AAAI
2006
15 years 6 months ago
2006
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model the...
139
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
121
click to vote
IPSN
2005
Springer
15 years 10 months ago
2005
Springer
: This paper addresses the problem of maximizing the service lifetime of a distributed battery-powered sensor network in the context of the network interdiction problem under user-...
132
Voted
VLSID
1994
IEEE
15 years 8 months ago
1994
IEEE
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...