Sciweavers

955 search results - page 94 / 191
» A System for Solving Constraint Satisfaction Problems with S...
Sort
View
ATAL
2006
Springer
13 years 12 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
KBSE
1997
IEEE
14 years 9 days ago
Genetic Algorithms for Dynamic Test Data Generation
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
Christoph C. Michael, Gary McGraw, Michael Schatz,...
FORMATS
2006
Springer
13 years 11 months ago
Matching Scenarios with Timing Constraints
Networks of communicating finite-state machines equipped with local clocks generate timed MSCs. We consider the problem of checking whether these timed MSCs are "consistent&qu...
Prakash Chandrasekaran, Madhavan Mukund
ASPDAC
2004
ACM
144views Hardware» more  ASPDAC 2004»
13 years 12 months ago
Verification of timed circuits with symbolic delays
When time is incorporated in the specification of discrete systems, the complexity of verification grows exponentially. When the temporal behavior is specified with symbols, the ve...
Robert Clarisó, Jordi Cortadella
CPAIOR
2010
Springer
13 years 6 months ago
Automatically Exploiting Subproblem Equivalence in Constraint Programming
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...
Geoffrey Chu, Maria Garcia de la Banda, Peter J. S...