7228 search results - page 1000 / 1446 » From Algorithmic to Subjective Randomness |
142
click to vote
PODC
2003
ACM
15 years 10 months ago
2003
ACM
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
148
click to vote
GD
2006
Springer
15 years 8 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
155
click to vote
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
140
Voted
SPLC
2008
15 years 6 months ago
2008
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
144
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
The No-Free-Lunch theorem is a fundamental result in the field of black-box function optimization. Recent work has shown that coevolution can exhibit free lunches. The question a...