Sciweavers

2607 search results - page 56 / 522
» Complete Functional Synthesis
Sort
View
119
Voted
EVOW
2010
Springer
15 years 10 months ago
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...
Günther R. Raidl, Bin Hu
GCB
1998
Springer
112views Biometrics» more  GCB 1998»
15 years 7 months ago
Combining diverse evidence for gene recognition in completely sequenced bacterial genomes
Analysis of a newly sequenced bacterial genome starts with identification of protein-coding genes. Functional assignment of proteins requires the exact knowledge of protein N-term...
Dmitrij Frishman, Andrey A. Mironov, Hans-Werner M...
AAAI
2004
15 years 4 months ago
Complete Local Search for Propositional Satisfiability
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
Hai Fang, Wheeler Ruml
IEE
2007
104views more  IEE 2007»
15 years 3 months ago
Complete distributed garbage collection using DGC-consistent cuts and .NET AOP-support
: The memory management of distributed objects, when done manually, is an error-prone task. It leads to memory leaks and dangling references, causing applications to fail. Avoiding...
Luís Veiga, P. Pereira, Paulo Ferreira
WSC
2007
15 years 5 months ago
Optimal scheduling of probabilistic repetitive projects using completed unit and genetic algorithms
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...
Chachrist Srisuwanrat, Photios G. Ioannou