Sciweavers

1101 search results - page 84 / 221
» heuristics 2007
Sort
View
JCSS
2007
116views more  JCSS 2007»
15 years 6 months ago
The most probable annotation problem in HMMs and its application to bioinformatics
Hidden Markov models (HMMs) are often used for biological sequence annotation. Each sequence feature is represented by a collection of states with the same label. In annotating a ...
Brona Brejová, Daniel G. Brown 0001, Tom&aa...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
16 years 16 days ago
On the behavioral diversity of random programs
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
Moshe Looks
JAIR
2007
107views more  JAIR 2007»
15 years 6 months ago
Compressed Pattern Databases
A pattern database (PDB) is a heuristic function implemented as a lookup table that stores the lengths of optimal solutions for subproblem instances. Standard PDBs have a distinct...
Ariel Felner, Richard E. Korf, Ram Meshulam, Rober...
CCCG
2007
15 years 7 months ago
A Disk-Covering Problem with Application in Optical Interferometry
Given a disk O in the plane called the objective, we want to find n small disks P1, . . . , Pn called the pupils such that n i,j=1 Pi Pj ⊇ O, where denotes the Minkowski diffe...
Trung Nguyen, Jean-Daniel Boissonnat, Fréd&...
AGTIVE
2007
Springer
16 years 17 days ago
A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...
Gernot Veit Batz, Moritz Kroll, Rubino Geiß