400 search results - page 57 / 80 » A Synthesis of Constraint Satisfaction and Constraint Solvin... |
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
LREC
2010
13 years 9 months ago
2010
This paper describes our work on developing corpora of three varieties of Viennese for unit selection speech synthesis. The synthetic voices for Viennese varieties, implemented wi...
AI
2000
Springer
13 years 7 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
IJSYSC
2000
13 years 7 months ago
2000
This paper is concerned with the design of robust state feedback controllers for a class of uncertain time-delay systems. The uncertainty is assumed to satisfy a certain integral ...
FOCI
2007
IEEE
14 years 2 months ago
2007
IEEE
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...