Sciweavers

2089 search results - page 12 / 418
» A New Problem in String Searching
Sort
View
EVOW
2008
Springer
14 years 11 months ago
Adaptive Local Search for a New Military Frequency Hopping Planning Problem
The military radio stations with frequency hopping propose new problems of frequency assignment which must take into account the size of the deployment, the limited resources and a...
Isabelle Devarenne, Alexandre Caminada, Hakim Mabe...
CLUSTER
2008
IEEE
15 years 4 months ago
Enabling lock-free concurrent fine-grain access to massive distributed data: Application to supernovae detection
—We consider the problem of efficiently managing massive data in a large-scale distributed environment. We consider data strings of size in the order of Terabytes, shared and ac...
Bogdan Nicolae, Gabriel Antoniu, Luc Bougé
56
Voted
INFORMS
2000
46views more  INFORMS 2000»
14 years 9 months ago
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
Luca Maria Gambardella, Marco Dorigo
ICDAR
2009
IEEE
14 years 7 months ago
Bayesian Similarity Model Estimation for Approximate Recognized Text Search
Approximate text search is a basic technique to handle recognized text that contains recognition errors. This paper proposes an approximate string search for recognized text using...
Atsuhiro Takasu
ISPAN
1997
IEEE
15 years 1 months ago
RMESH Algorithms for Parallel String Matching
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
Hsi-Chieh Lee, Fikret Erçal