16257 search results - page 333 / 3252 » D-finiteness: algorithms and applications |
178
click to vote
FSMNLP
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. Stochastic finite automata are useful for identifying substrings (chunks) within larger units of text. Relevant applications include tokenization, base-NP chunking, name...
184
click to vote
GECCO
2005
Springer
16 years 7 days ago
2005
Springer
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
213
click to vote
LSSC
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
177
click to vote
CSB
2003
IEEE
16 years 16 hour ago
2003
IEEE
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
178
click to vote
EUROPAR
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Parallel relational databases have been successful in providing scalable performance for data intensive applications, and much work has been carried out on query processi...