808 search results - page 56 / 162 » A scaling algorithm for polynomial constraint satisfaction p... |
149
click to vote
BVAI
2007
Springer
15 years 3 months ago
2007
Springer
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
CSCLP
2007
Springer
15 years 3 months ago
2007
Springer
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
60
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
103
Voted
ECAI
2008
Springer
14 years 11 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...
CP
2004
Springer
15 years 3 months ago
2004
Springer
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...