7811 search results - page 1266 / 1563 » computing 2004 |
127
click to vote
AIMSA
2004
Springer
15 years 9 months ago
2004
Springer
Nowadays, many real problem in Artificial Intelligence can be modeled as constraint satisfaction problems (CSPs). A general rule in constraint satisfaction is to tackle the hardes...
163
click to vote
AMAI
2004
Springer
15 years 9 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
119
click to vote
AMAI
2004
Springer
15 years 9 months ago
2004
Springer
The paper integrates automatically generated case-splitting expressions, and an efficient translation to CNF, in order to formally verify an out-of-order superscalar processor havi...
153
click to vote
AMEC
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In a combinatorial auction, there are multiple items for sale, and bidders are allowed to place a bid on a bundle of these items rather than just on the individual items....
129
click to vote
ANTSW
2004
Springer
15 years 9 months ago
2004
Springer
Designing an optimal overlay communication network for a set of processes on the Internet is a central problem of peer-to-peer (P2P) computing. Such a network defines membership a...