Sciweavers

GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
14 years 3 months ago
An Enhanced Genetic Algorithm for DNA Sequencing by Hybridization with Positive and Negative Errors
Abstract. This paper describes a genetic algorithm for the DNA sequencing problem. The algorithm allows the input spectrum to contain both positive and negative errors as could be ...
Thang Nguyen Bui, Waleed A. Youssef
GECCO
2004
Springer
152views Optimization» more  GECCO 2004»
14 years 3 months ago
Ant System for the k-Cardinality Tree Problem
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
Thang Nguyen Bui, Gnanasekaran Sundarraj
GD
2004
Springer
14 years 3 months ago
Visualisation of Large and Complex Networks Using PolyPlane
This paper discusses a new method for visualisation of large and complex networks in three dimensions. In particular, we focus on visualising the core tree structure of the large a...
Seok-Hee Hong, Tom Murtagh
FORMATS
2004
Springer
14 years 3 months ago
Learning of Event-Recording Automata
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
Olga Grinchtein, Bengt Jonsson, Martin Leucker
EVOW
2004
Springer
14 years 3 months ago
Self-Adaptive Scouting - Autonomous Experimentation for Systems Biology
Abstract. We introduce a new algorithm for autonomous experimentation. This algorithm uses evolution to drive exploration during scientific discovery. Population size and mutation...
Naoki Matsumaru, Florian Centler, Klaus-Peter Zaun...
EUROCRYPT
2004
Springer
14 years 3 months ago
Finding Small Roots of Bivariate Integer Polynomial Equations Revisited
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
Jean-Sébastien Coron
ESA
2004
Springer
137views Algorithms» more  ESA 2004»
14 years 3 months ago
Fast 3-Coloring Triangle-Free Planar Graphs
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
Lukasz Kowalik
ESA
2004
Springer
106views Algorithms» more  ESA 2004»
14 years 3 months ago
Stable Minimum Storage Merging by Symmetric Comparisons
We introduce a new stable minimum storage algorithm for merging that needs O(m log( n m + 1)) element comparisons, where m and n are the sizes of the input sequences with m ≤ n. ...
Pok-Son Kim, Arne Kutzner
ESA
2004
Springer
143views Algorithms» more  ESA 2004»
14 years 3 months ago
Data Migration on Parallel Disks
Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such storage servers are used as web servers or multimedia servers, for handling...
Leana Golubchik, Samir Khuller, Yoo Ah Kim, Svetla...
ESA
2004
Springer
128views Algorithms» more  ESA 2004»
14 years 3 months ago
Incremental Algorithms for Facility Location and k-Median
In the incremental versions of Facility Location and k-Median, the demand points arrive one at a time and the algorithm must maintain a good solution by either adding each new dema...
Dimitris Fotakis