Sciweavers

1887 search results - page 13 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
JAR
2002
72views more  JAR 2002»
13 years 7 months ago
Partial Instantiation Methods for Inference in First-Order Logic
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...
John N. Hooker, G. Rago, V. Chandru, A. Shrivastav...
VLDB
2007
ACM
260views Database» more  VLDB 2007»
14 years 7 months ago
Approaching the Skyline in Z Order
Given a set of multidimensional data points, skyline query retrieves a set of data points that are not dominated by any other points. This query is useful for multi-preference ana...
Ken C. K. Lee, Baihua Zheng, Huajing Li, Wang-Chie...
IPPS
2007
IEEE
14 years 1 months ago
Decomposing Partial Order Execution Graphs to Improve Message Race Detection
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
EVOW
2008
Springer
13 years 9 months ago
Efficient Local Search Limitation Strategies for Vehicle Routing Problems
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with th...
Yuichi Nagata, Olli Bräysy
AAAI
2006
13 years 9 months ago
Learning Partially Observable Action Models: Efficient Algorithms
We present tractable, exact algorithms for learning actions' effects and preconditions in partially observable domains. Our algorithms maintain a propositional logical repres...
Dafna Shahaf, Allen Chang, Eyal Amir