Sciweavers

606 search results - page 74 / 122
» Complexity Results for Checking Distributed Implementability
Sort
View
CADE
2005
Springer
16 years 2 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
115
Voted
IJCAI
2003
15 years 3 months ago
In Defense of PDDL Axioms
There is controversy as to whether explicit support for PDDL-like axioms and derived predicates is needed for planners to handle real-world domains effectively. Many researchers h...
Sylvie Thiébaux, Jörg Hoffmann, Bernha...
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 6 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
JCP
2007
143views more  JCP 2007»
15 years 1 months ago
Alternatives for In-Service BER Estimation in All-Optical Networks: Towards Minimum Intrusion
— Combining the existing approaches for optical intelligence and the speed and capacity of light is undoubtedly the only viable strategy for building future-proof, highspeed netw...
Carolina Pinart
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 8 months ago
Evolving virtual creatures revisited
Thirteen years have passed since Karl Sims published his work on evolving virtual creatures. Since then, several novel approaches to neural network evolution and genetic algorithm...
Peter Krcah