365 search results - page 50 / 73 » An Approach to Multiply Segmented Constraint Satisfaction Pr... |
101
click to vote
CP
2006
Springer
15 years 4 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
89
Voted
NOMS
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—We study the problem of dynamic resource allocation to clustered Web applications. We extend application server middleware with the ability to automatically decide the s...
101
Voted
IJCAI
2007
15 years 1 months ago
2007
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
128
click to vote
CORR
1998
Springer
15 years 4 days ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
118
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...