900 search results - page 92 / 180 » On Polynomial Time Computation over Unordered Structures |
109
click to vote
ICSOC
2007
Springer
15 years 9 months ago
2007
Springer
Web services are rapidly emerging as a popular standard for sharing data and functionality among heterogeneous systems. We propose a general purpose Web Service Management System (...
149
click to vote
FOCS
1999
IEEE
15 years 7 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
117
click to vote
ICNP
1999
IEEE
15 years 7 months ago
1999
IEEE
In this paper, we propose a receiver-cooperative bandwidth management method for layered multicast streams, considering not only bandwidth requirements but also receivers' pr...
121
click to vote
IJCAI
2003
15 years 4 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
121
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...