Sciweavers

166 search results - page 20 / 34
» Fixed-parameter evolutionary algorithms and the vertex cover...
Sort
View
80
Voted
PDCN
2004
14 years 11 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
91
Voted
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 1 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
80
Voted
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
14 years 11 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
15 years 9 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
GECCO
2006
Springer
145views Optimization» more  GECCO 2006»
15 years 1 months ago
Immune anomaly detection enhanced with evolutionary paradigms
The paper presents an approach based on principles of immune systems to the anomaly detection problem. Flexibility and efficiency of the anomaly detection system are achieved by b...
Marek Ostaszewski, Franciszek Seredynski, Pascal B...