1712 search results - page 144 / 343 » A Computational Approach to Binding Theory |
125
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
ACG
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Commercial games have various methods of game balancing, which modify the game’s entertainment value for players of different skill levels. This paper presents a way o...
106
click to vote
AIMS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Traditional approaches to multipath routing ignore the economic incentives necessary in aligning both networks and users towards a common goal. While theory suggests cong...
80
Voted
BIRTHDAY
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Variables make rule-based systems more abstract and expressive, as witnessed by term rewriting systems and two-level grammars. In this paper we show that variables can be...
112
click to vote
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...