224 search results - page 36 / 45 » Three New Algorithms for Regular Language Enumeration |
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
ICALP
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
DLS
2008
14 years 11 months ago
2008
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
COLING
2000
14 years 10 months ago
2000
A translation is a conversion from a source language into a target language preserving the meaning. A huge number of techniques and computational approaches have been experimented...