4345 search results - page 213 / 869 » Temporal Constraint Networks |
138
click to vote
ICN
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This paper considers the primary and secondary path generation problem in traffic engineering. We first present a standard MILP model. Since its size and integrality gap...
189
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
160
click to vote
CORR
2008
Springer
15 years 6 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...
169
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
168
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...