Sciweavers

3965 search results - page 488 / 793
» Effectivity of Regular Spaces
Sort
View
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
15 years 10 months ago
"Optimal" mutation rates for genetic search
Using a set of model landscapes we examine how different mutation rates affect different search metrics. We show that very universal heuristics, such as 1/N and the error threshol...
Jorge Cervantes, Christopher R. Stephens
GECCO
2006
Springer
171views Optimization» more  GECCO 2006»
15 years 10 months ago
A hybrid genetic search for multiple sequence alignment
This paper proposes a hybrid genetic algorithm for multiple sequence alignment. The algorithm evolves guide sequences and aligns input sequences based on the guide sequences. It a...
Seung-Hyun Moon, Sung-Soon Choi, Byung Ro Moon
ACSC
2001
IEEE
15 years 10 months ago
Starting with Termination: A Methodology for Building Distributed Garbage Collection Algorithms
We propose an effective methodology in which a distributed garbage collector may be derived from a distributed termination algorithm and a centralized garbage collector in a manne...
Stephen M. Blackburn, J. Eliot B. Moss, Richard L....
EDBT
2000
ACM
15 years 10 months ago
Management and Query Processing of One-Dimensional Intervals with the UB-Tree
The management and query processing of one dimensional intervals is a special case of extended object handling. One dimensional intervals play an important role in temporal databa...
Robert Fenk
ICCAD
1998
IEEE
83views Hardware» more  ICCAD 1998»
15 years 10 months ago
Lazy transition systems: application to timing optimization of asynchronous circuits
This paper introduces Lazy Transitions Systems (LzTSs). The notion of laziness explicitly distinguishes between the enabling and the firing of an event in a transition system. LzT...
Jordi Cortadella, Michael Kishinevsky, Alex Kondra...