Sciweavers

882 search results - page 62 / 177
» Local Search for Very Large SAT Problems
Sort
View
ICASSP
2008
IEEE
15 years 6 months ago
Admissible stopping in viterbi beam search for unit selection in concatenative speech synthesis
Corpus-based concatenative speech synthesis is very popular these days due to its highly natural speech quality. The amount of computation required in the run time, however, is of...
Shinichi Sakai, Tatsuya Kawahara, Shun Nakamura
79
Voted
ACG
2006
Springer
15 years 5 months ago
Recognizing Seki in Computer Go
Seki is a situation of coexistence in the game of Go, where neither player can profitably capture the opponent’s stones. This paper presents a new method for deciding whether an...
Xiaozhen Niu, Akihiro Kishimoto, Martin Mülle...
DELOS
2004
15 years 1 months ago
Towards Collaborative Search in Digital Libraries Using Peer-to-Peer Technology
We consider the problem of collaborative search across a large number of digital libraries and query routing strategies in a peerto-peer (P2P) environment. Both digital libraries a...
Matthias Bender, Sebastian Michel, Christian Zimme...
ISMIS
1999
Springer
15 years 4 months ago
Applications and Research Problems of Subgroup Mining
Knowledge Discovery in Databases (KDD) is a data analysis process which, in contrast to conventional data analysis, automatically generates and evaluates very many hypotheses, deal...
Willi Klösgen
HAIS
2009
Springer
15 years 4 months ago
Evolutionary Non-linear Great Deluge for University Course Timetabling
This paper presents a hybrid evolutionary algorithm to tackle university course timetabling problems. The proposed approach is an extension of a non-linear great deluge algorithm i...
Dario Landa Silva, Joe Henry Obit