Sciweavers

1523 search results - page 24 / 305
» Partially ordered secretaries
Sort
View
FOCS
2006
IEEE
15 years 6 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys
110
Voted
CONCUR
2000
Springer
15 years 4 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny
135
Voted
CONCUR
1999
Springer
15 years 4 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
96
Voted
IJCAI
2003
15 years 1 months ago
Multiagent Planning with Partially Ordered Temporal Plans
This paper discusses the specifics of planning in multiagent environments. It presents the formal framework MAPL (“maple”) for describing multiagent planning domains. MAPL al...
Michael Brenner
116
Voted
AAAI
1996
15 years 1 months ago
Design and Implementation of a Replay Framework Based on a Partial Order Planner
In this paper we describe the design and implementation of the derivation replay framework, dersnlp+ebl (Derivational snlp+ebl), which is based within a partial order planner. der...
Laurie H. Ihrig, Subbarao Kambhampati