Sciweavers

2089 search results - page 53 / 418
» A New Problem in String Searching
Sort
View
IJCAI
2003
14 years 11 months ago
A lookahead strategy for solving large planning problems
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
Vincent Vidal
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
15 years 2 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
15 years 2 months ago
A Hybrid Immune Algorithm with Information Gain for the Graph Coloring Problem
We present a new Immune Algorithm that incorporates a simple local search procedure to improve the overall performances to tackle the graph coloring problem instances. We character...
Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone
ICEC
1994
37views more  ICEC 1994»
14 years 11 months ago
A Method for Utilizing Diploid/Dominance in Genetic Search
homologous alleles seemingly compete prior to manifestation in the observed phenotype, will be referred to as sub-phenotype interaction.A method is proposed for implementing diploi...
F. Greene
CIMCA
2006
IEEE
15 years 3 months ago
A Junction Based Segmentation Algorithm for Offline Handwritten Connected Character Segmentation
A junction based approach for Segmenting and recognizing offline handwritten connected twodigit strings is presented in this paper. Very often even in a printed text, adjacent cha...
U. K. S. Jayarathna, G. E. M. D. C. Bandara