4451 search results - page 603 / 891 » On Random Ordering Constraints |
170
Voted
JOIN
2007
15 years 6 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
178
click to vote
AI
2000
Springer
15 years 6 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
153
click to vote
TON
2002
15 years 6 months ago
2002
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
219
click to vote
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
216
click to vote
AI
2012
Springer
14 years 2 months ago
2012
Springer
This paper describes a challenging plan recognition problem that arises in environments in which agents engage widely in exploratory behavior, and presents new algorithms for eff...