Sciweavers

206 search results - page 17 / 42
» Random backtracking in backtrack search algorithms for satis...
Sort
View
ICTAI
1996
IEEE
14 years 18 days ago
Forward-Tracking: A Technique for Searching Beyond Failure
In many applications, such as decision support, negotiation, planning, scheduling, etc., one needs to express requirements that can only be partially satisfied. In order to expres...
Elena Marchiori, Massimo Marchiori, Joost N. Kok
COR
2008
103views more  COR 2008»
13 years 8 months ago
A tabu search algorithm for structural software testing
This paper presents a tabu search metaheuristic algorithm for the automatic generation of structural software tests. It is a novel work since tabu search is applied to the automat...
Eugenia Díaz, Javier Tuya, Raquel Blanco, J...
ATVA
2008
Springer
131views Hardware» more  ATVA 2008»
13 years 10 months ago
Dynamic Model Checking with Property Driven Pruning to Detect Race Conditions
We present a new property driven pruning algorithm in dynamic model checking to efficiently detect race conditions in multithreaded programs. The main idea is to use a lockset base...
Chao Wang, Yu Yang, Aarti Gupta, Ganesh Gopalakris...
CPAIOR
2005
Springer
14 years 2 months ago
Nondeterministic Control for Hybrid Search
Hybrid algorithms combining local and systematic search often use nondeterminism in fundamentally different ways. They may differ in the strategy to explore the search tree and/o...
Pascal Van Hentenryck, Laurent Michel
ATAL
2006
Springer
14 years 6 days ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh