2410 search results - page 321 / 482 » Multiset Ordering Constraints |
131
Voted
TON
2002
15 years 4 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...
177
click to vote
TACAS
2010
Springer
15 years 2 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 ...
189
click to vote
AI
2012
Springer
14 years 23 days 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...
169
click to vote
SARA
2009
Springer
15 years 11 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
145
Voted
MSWIM
2006
ACM
15 years 11 months ago
2006
ACM
In this paper, we define a model of an ad hoc routing protocol, i.e. the OLSR (Optimized Link-State Routing) protocol. This model handles novel constraints related to such networ...