Sciweavers

19700 search results - page 3673 / 3940
» DNA-Based Computation Times
Sort
View
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
16 years 20 days ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
SIGECOM
2006
ACM
96views ECommerce» more  SIGECOM 2006»
16 years 20 days ago
Non-cooperative multicast and facility location games
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan,...
SPAA
2006
ACM
16 years 20 days ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...
SPAA
2006
ACM
16 years 20 days ago
Network design with weighted players
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
Ho-Lin Chen, Tim Roughgarden
ACSC
2005
IEEE
16 years 10 days ago
A Formal Approach to Component Adaptation and Composition
Component based software engineering (CBSE), can in principle lead to savings in the time and cost of software development, by encouraging software reuse. However the reality is t...
David Hemer
« Prev « First page 3673 / 3940 Last » Next »