Sciweavers

8496 search results - page 98 / 1700
» Problem Solving and Complex Systems
Sort
View
CP
2009
Springer
14 years 8 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 8 months ago
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
Rahul Jain, Hartmut Klauck, Miklos Santha
VMCAI
2009
Springer
14 years 2 months ago
Synthesizing Switching Logic Using Constraint Solving
A new approach based on constraint solving techniques was recently proposed for verification of hybrid systems. This approach works by searching for inductive invariants of a give...
Ankur Taly, Sumit Gulwani, Ashish Tiwari
DATE
2010
IEEE
168views Hardware» more  DATE 2010»
14 years 8 days ago
Verifying UML/OCL models using Boolean satisfiability
Abstract--Nowadays, modeling languages like UML are essential in the design of complex software systems and also start to enter the domain of hardware and hardware/software codesig...
Mathias Soeken, Robert Wille, Mirco Kuhlmann, Mart...
ECAI
2006
Springer
13 years 11 months ago
AI and Music: Toward a Taxonomy of Problem Classes
The application of Artificial Intelligence technology to the field of music has always been fascinating, from the first attempts in automating human problem solving behavior till t...
Oliver Kramer, Benno Stein, Jürgen Wall