1027 search results - page 114 / 206 » Comparing Search Algorithms for the Temperature Inversion Pr... |
CPM
1998
Springer
14 years 1 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
AI
2005
Springer
13 years 9 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
FMCO
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In recent years a bundle of parallel and distributed algorithms for verification of finite state systems has appeared. We survey distributed-memory enumerative LTL mode...
SIGIR
2008
ACM
13 years 9 months ago
2008
ACM
Address geocoding, the process of finding the map location for a structured postal address, is a relatively well-studied problem. In this paper we consider the more general proble...
ESTIMEDIA
2009
Springer
14 years 3 months ago
2009
Springer
— The complexity of today’s embedded systems forces designers to model and simulate systems and their components to explore the wide range of design choices. Such design space ...