Sciweavers

660 search results - page 22 / 132
» Hybrid CSP Solving
Sort
View
APIN
1999
143views more  APIN 1999»
13 years 9 months ago
Solving Electrical Distribution Problems Using Hybrid Evolutionary Data Analysis Techniques
Real-world electrical engineering problems can take advantage of the last Data Analysis methodologies. In this paper we will show that Genetic Fuzzy Rule-Based Systems and Genetic ...
Oscar Cordón, Francisco Herrera, Luciano S&...
VMCAI
2009
Springer
14 years 4 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
EVOW
2008
Springer
13 years 11 months ago
A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems
This paper introduces a hybrid Tabu Search - Evolutionary Algorithm for solving the binary constraint satisfaction problem, called CTLEA. A continuation of an earlier introduced al...
Bart G. W. Craenen, Ben Paechter
HYBRID
2007
Springer
14 years 1 months ago
Solving Coverage Problems with Embedded Graph Grammars
We show how Embedded Graph Grammars (EGGs) are used to specify local interaction rules between mobile robots in a natural manner. This formalism allows us to treat local network to...
John-Michael McNew, Eric Klavins, Magnus Egerstedt
FOCS
2007
IEEE
14 years 4 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx