3758 search results - page 287 / 752 » A Complete Subsumption Algorithm |
156
click to vote
SPIN
2005
Springer
16 years 2 days ago
2005
Springer
We present a novel algorithm for repairing structurally complex data. Given an assertion that represents desired structural integrity constraints and a structure that violates them...
163
click to vote
STOC
1997
ACM
15 years 10 months ago
1997
ACM
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
183
click to vote
ICS
1994
Tsinghua U.
15 years 10 months ago
1994
Tsinghua U.
We present a parallel code generation algorithm for complete applications and a new experimental methodology that tests the efficacy of our approach. The algorithm optimizes for d...
151
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we develop a novel algorithm that allows service consumer agents to automatically select and provision service provider agents for their workflows in highly dynamic...
181
click to vote
FLAIRS
2006
15 years 8 months ago
2006
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...