1277 search results - page 170 / 256 » Terminating Decision Algorithms Optimally |
155
click to vote
WAOA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
153
Voted
AI
2010
Springer
15 years 15 days ago
2010
Springer
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...
119
Voted
DAC
2005
ACM
16 years 4 months ago
2005
ACM
The increased deployment of System-on-Chip designs has drawn attention to the limitations of on-chip interconnects. As a potential solution to these limitations, Networks-on -Chip...
201
Voted
DAC
2005
ACM
16 years 4 months ago
2005
ACM
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
158
Voted
STOC
2004
ACM
16 years 4 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...