Sciweavers

1888 search results - page 169 / 378
» Proof theory and computational analysis
Sort
View
91
Voted
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
16 years 1 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
89
Voted
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
15 years 7 months ago
Rigorous analyses of simple diversity mechanisms
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
113
Voted
BCSHCI
2007
15 years 2 months ago
Design in evaluation: reflections on designing for children's technology
This paper reflects on the design value that emerges from evaluation methods used in the field of child computer interaction. The work is based around an evaluation study of a tan...
Emanuela Mazzone, Diana Yifan Xu, Janet C. Read
FOGA
2011
14 years 4 months ago
The logarithmic hypervolume indicator
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
Tobias Friedrich, Karl Bringmann, Thomas Voß...
113
Voted
SAIG
2000
Springer
15 years 4 months ago
Generating Data Analysis Programs from Statistical Models
Extracting information from data, often also called data analysis, is an important scienti c task. Statistical approaches, which use methods from probability theory and numerical a...
Bernd Fischer 0002, Johann Schumann, Thomas Pressb...