Sciweavers

304 search results - page 15 / 61
» Mathematical Models of Computational and Combinatorial Struc...
Sort
View
131
Voted
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 4 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
116
Voted
ECAL
2007
Springer
15 years 7 months ago
Group Size Effects on the Emergence of Compositional Structures in Language
This paper presents computer simulations which investigate the effect that different group sizes have on the emergence of compositional structures in languages. The simulations are...
Paul Vogt
127
Voted
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 7 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
149
Voted
VRST
2003
ACM
15 years 9 months ago
Time-critical collision detection using an average-case approach
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
Jan Klein, Gabriel Zachmann
140
Voted
TCS
2010
15 years 2 months ago
Maximum likelihood analysis of algorithms and data structures
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
Ulrich Laube, Markus E. Nebel