Sciweavers

693 search results - page 6 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
128
Voted
IJCAI
2003
15 years 3 months ago
In the quest of the best form of local consistency for Weighted CSP
The weighted CSP (WCSP) framework is a soft constraint framework with a wide range of applications. In this paper, we consider the problem of maintaining local consistency during ...
Javier Larrosa, Thomas Schiex
121
Voted
CP
2007
Springer
15 years 5 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
SODA
1998
ACM
86views Algorithms» more  SODA 1998»
15 years 3 months ago
Analysis of a Local Search Heuristic for Facility Location Problems
Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Ra...
ICTAI
2002
IEEE
15 years 6 months ago
On Temporal Planning as CSP
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
Amol Dattatraya Mali
AAAI
2007
15 years 4 months ago
On the Value of Good Advice: The Complexity of A* Search with Accurate Heuristics
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
Hang T. Dinh, Alexander Russell, Yuan Su