13841 search results - page 212 / 2769 » Algorithms and Constraint Programming |
AAAI
1998
15 years 8 months ago
1998
Weextendthe frameworkof simple temporalproblems studied originally by Dechter,MeiriandPearl to consider constraints of the formxl - yl < rl V... v xn yn <_rn, wherexl ... xn...
173
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention start...
166
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
185
click to vote
IJCAI
1989
15 years 7 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...