4451 search results - page 604 / 891 » On Random Ordering Constraints |
200
click to vote
SARA
2009
Springer
16 years 1 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...
180
click to vote
MSWIM
2006
ACM
16 years 18 days 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...
197
click to vote
IUI
2004
ACM
16 years 1 days ago
2004
ACM
Complex applications in many areas, including scientific computations and business-related web services, are created from collections of components to form workflows. In many case...
169
click to vote
ECAI
2004
Springer
16 years 21 hour ago
2004
Springer
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
186
click to vote
REFLECTION
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Using mobile agent systems, cooperative distributed applications that run over the Internet can be constructed flexibly. However, there are some problems: it is difficul...