Sciweavers

3320 search results - page 390 / 664
» Heuristics for the Phylogeny Problem
Sort
View
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
16 years 4 days ago
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
Jörn Grahl, Franz Rothlauf
CSB
2003
IEEE
150views Bioinformatics» more  CSB 2003»
16 years 1 days ago
Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
INFOCOM
2003
IEEE
16 years 1 days ago
The Impact of Correlated Link Weights on QoS Routing
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...
Fernando A. Kuipers, Piet Van Mieghem
PDP
2003
IEEE
16 years 21 hour ago
A Parallel Evolutionary Algorithm for Circuit Partitioning
As general-purpose parallel computers are increasingly being used to speed up different VLSI applications, the development of parallel algorithms for circuit testing, logic minimi...
Raul Baños, Consolación Gil, Maria D...
TAMC
2010
Springer
15 years 11 months ago
Incremental List Coloring of Graphs, Parameterized by Conservation
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
Sepp Hartung, Rolf Niedermeier