337 search results - page 15 / 68 » Network design with weighted players |
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
80
Voted
ACMACE
2009
ACM
15 years 2 months ago
2009
ACM
In this paper, we describe the design and development of a social game called Familiars. Inspired by the daemons in Pullman’s “Dark Material” trilogy, Familiars are animal c...
68
Voted
AAAI
2006
14 years 11 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
ESA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
EGC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The promise of the grid is that it will enable public access and sharing of immense amounts of computational and data resources among dynamic coalitions of individuals an...