1381 search results - page 100 / 277 » Computational Complexity of Constraint Satisfaction |
166
click to vote
CORR
1998
Springer
15 years 4 months 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 ...
150
click to vote
CP
2000
Springer
15 years 8 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
141
click to vote
JFP
2000
15 years 4 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
127
click to vote
SKG
2006
IEEE
15 years 10 months ago
2006
IEEE
Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate ...
150
click to vote
QSHINE
2005
IEEE
15 years 9 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...