29908 search results - page 5761 / 5982 » On the complexity of communication complexity |
193
click to vote
DAM
2008
15 years 6 months ago
2008
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...
206
click to vote
DCG
2008
15 years 6 months ago
2008
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
145
click to vote
EOR
2010
15 years 6 months ago
2010
A significant input-data uncertainty is often present in practical situations. One approach to coping with this uncertainty is to describe the uncertainty with scenarios. A scenar...
176
click to vote
ADHOC
2006
15 years 6 months ago
2006
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
172
click to vote
AI
2006
Springer
15 years 6 months ago
2006
Springer
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...