949 search results - page 51 / 190 » Theory of Constraints |
AAAI
1990
15 years 1 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
CORR
2007
Springer
15 years 18 days ago
2007
Springer
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
118
click to vote
POPL
1990
ACM
15 years 4 months ago
1990
ACM
Abstract. Concurrent constraint programming is a simple but powerful framework for computation based on four basic computational ideas: concurrency (multiple agents are simultaneou...
103
click to vote
CISSE
2008
Springer
15 years 2 months ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
113
Voted
MP
2010
14 years 11 months ago
2010
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...