Sciweavers

877 search results - page 134 / 176
» How to Cover a Grammar
Sort
View
ICLP
1994
Springer
15 years 10 months ago
Splitting a Logic Program
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
Vladimir Lifschitz, Hudson Turner
KR
1994
Springer
15 years 10 months ago
Refinement Search as a Unifying Framework for Analyzing Planning Algorithms
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorith...
Subbarao Kambhampati
CEC
2007
IEEE
15 years 9 months ago
Efficient assembling of genome fragments using genetic algorithm enhanced by heuristic search
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
Satoko Kikuchi, Goutam Chakraborty
DEBS
2007
ACM
15 years 9 months ago
Concepts and models for typing events for event-based systems
Event-based systems are increasingly gaining widespread attention for applications that require integration with loosely coupled and distributed systems for time-critical business...
Szabolcs Rozsnyai, Josef Schiefer, Alexander Schat...
CAV
2010
Springer
239views Hardware» more  CAV 2010»
15 years 9 months ago
Model Checking of Linearizability of Concurrent List Implementations
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
Pavol Cerný, Arjun Radhakrishna, Damien Zuf...