Sciweavers

689 search results - page 87 / 138
» Encapsulation theory fundamentals
Sort
View
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
14 years 4 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
WDAG
2009
Springer
146views Algorithms» more  WDAG 2009»
14 years 4 months ago
Dynamics in Network Interaction Games
We study the convergence times of dynamics in games involving graphical relationships of players. Our model of local interaction games generalizes a variety of recently studied ga...
Martin Hoefer, Siddharth Suri
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 4 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day
FMN
2009
Springer
90views Multimedia» more  FMN 2009»
14 years 4 months ago
Performance Evaluation of the Split Transmission in Multihop Wireless Networks
Multimedia applications in multihop wireless networks have great market potential. Multiple channels and multiple radios are commonly used for exploring multimedia transmissions in...
Wanqing Tu, Vic Grout
OOPSLA
2009
Springer
14 years 4 months ago
Typestate-oriented programming
Objects model the world, and state is fundamental to a faithful modeling. Engineers use state machines to understand and reason about state transitions, but programming languages ...
Jonathan Aldrich, Joshua Sunshine, Darpan Saini, Z...