278 search results - page 22 / 56 » ijcai 2003 |
71
Voted
IJCAI
2003
15 years 2 months ago
2003
Most probabilistic inference algorithms are specified and processed on a propositional level. In the last decade, many proposals for algorithms accepting first-order specificat...
114
Voted
IJCAI
2003
15 years 2 months ago
2003
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 ...
126
click to vote
IJCAI
2003
15 years 2 months ago
2003
We consider the problem of updating nonmonotonic knowledge bases represented by epistemic logic programs where disjunctive information and notions of knowledge and beliefs can be ...
110
Voted
IJCAI
2003
15 years 2 months ago
2003
We empirically study phase transitions of the asymmetric Traveling Salesman. Using random instances of up to 1,500 cities, we show that many properties of the problem, including t...
118
click to vote
IJCAI
2003
15 years 2 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...