2681 search results - page 435 / 537 » Problem F |
167
click to vote
GECCO
2009
Springer
16 years 25 days ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
158
click to vote
GECCO
2007
Springer
16 years 13 days ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
192
click to vote
IPSN
2007
Springer
16 years 12 days ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
161
click to vote
COMPGEOM
2006
ACM
16 years 7 days ago
2006
ACM
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
178
click to vote
PODC
2006
ACM
16 years 7 days ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...