Sciweavers

360 search results - page 67 / 72
» Explanations and Proof Trees
Sort
View
FLAIRS
2004
13 years 9 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels
IJCAI
2003
13 years 9 months ago
Consistency and Set Intersection
We propose a new framework to study properties of consistency in a Constraint Network from the perspective of properties of set intersection. Our framework comes with a proof sche...
Yuanlin Zhang, Roland H. C. Yap
DAM
2007
153views more  DAM 2007»
13 years 7 months ago
Computing the minimum number of hybridization events for a consistent evolutionary history
It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...
Magnus Bordewich, Charles Semple
ICRA
2010
IEEE
150views Robotics» more  ICRA 2010»
13 years 6 months ago
Balancing state-space coverage in planning with dynamics
— Sampling-based kinodynamic planners, such as the popular RRT algorithm, have been proposed as promising solutions to planning for systems with dynamics. Nevertheless, complex s...
Yanbo Li, Kostas E. Bekris
HASKELL
2009
ACM
14 years 2 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...