13603 search results - page 88 / 2721 » On the Computational Complexity of Cut-Reduction |
174
click to vote
SIGGRAPH
1994
ACM
15 years 10 months ago
1994
ACM
We present an approach for accelerating hierarchical radiosity by clustering objects. Previous approaches constructed effective hierarchies by subdividing surfaces, but could not ...
172
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
154
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Recent work by Procaccia, Rosenschein and Zohar [14] established some results regarding the complexity of manipulation and control in elections with multiple winners, such as elec...
163
click to vote
IJCAI
2001
15 years 7 months ago
2001
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
225
click to vote
AAAI
2012
13 years 8 months ago
2012
We extend work by Christian et al. [Review of Economic Design 2007] on lobbying in multiple referenda by first providing a more fine-grained analysis of the computational comple...