Sciweavers

179 search results - page 20 / 36
» eccc 2010
Sort
View
ECCC
2006
112views more  ECCC 2006»
13 years 7 months ago
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...
Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas
ECCC
2006
90views more  ECCC 2006»
13 years 7 months ago
Comparing Reductions to NP-Complete Sets
Under the assumption that NP does not have p-measure 0, we investigate reductions to NP-complete sets and prove the following: (1) Adaptive reductions are more powerful than nonad...
John M. Hitchcock, Aduri Pavan
ECCC
2006
97views more  ECCC 2006»
13 years 7 months ago
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...
Frank Neumann, Carsten Witt
ECCC
2006
96views more  ECCC 2006»
13 years 7 months ago
When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---
Detecting the relevant attributes of an unknown target concept is an important and well studied problem in algorithmic learning. Simple greedy strategies have been proposed that s...
Jan Arpe, Rüdiger Reischuk
ECCC
2006
71views more  ECCC 2006»
13 years 7 months ago
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
Spyros C. Kontogiannis, Panagiota N. Panagopoulou,...