Sciweavers

1376 search results - page 255 / 276
» Searching Trees: An Essay
Sort
View
STACS
1992
Springer
15 years 3 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
FLOPS
2008
Springer
15 years 1 months ago
Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
Rafael Caballero, Mario Rodríguez-Artalejo,...
ATAL
2010
Springer
15 years 27 days ago
Multi robotic exploration with communication requirement to a fixed base station
d Abstract) Piyoosh Mukhija IIIT Hyderabad Rahul Sawhney IIIT Hyderabad K Madhava Krishna IIIT Hyderabad We present an algorithm for multi robotic exploration of an unknown terrai...
Piyoosh Mukhija, Rahul Sawhney, K. Madhava Krishna
GECCO
2008
Springer
175views Optimization» more  GECCO 2008»
15 years 26 days ago
Using differential evolution for symbolic regression and numerical constant creation
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
Brian M. Cerny, Peter C. Nelson, Chi Zhou
BMCBI
2008
200views more  BMCBI 2008»
14 years 12 months ago
Defining functional distances over Gene Ontology
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...
Angela del Pozo, Florencio Pazos, Alfonso Valencia