Sciweavers

855 search results - page 24 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
AMAI
2006
Springer
14 years 9 months ago
Bargaining over multiple issues in finite horizon alternating-offers protocol
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
Francesco Di Giunta, Nicola Gatti
JAIR
2011
103views more  JAIR 2011»
14 years 4 months ago
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
C. Geist, Ulrich Endriss
DCC
2007
IEEE
15 years 9 months ago
Distortion-Complexity Optimization of the H.264/MPEG-4 AVC Encoder using the GBFOS Algorithm
The H.264/ACV standard provides significant improvements in performance over earlier video coding standards at the cost of increased complexity. Our challenge is to determine H.26...
Rahul Vanam, Eve A. Riskin, Sheila S. Hemami, Rich...
ECCC
2006
109views more  ECCC 2006»
14 years 9 months ago
How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
Claire Kenyon-Mathieu, Warren Schudy
DATE
2006
IEEE
94views Hardware» more  DATE 2006»
15 years 3 months ago
Procrastinating voltage scheduling with discrete frequency sets
This paper presents an efficient method to find the optimal intra-task voltage/frequency scheduling for single tasks in practical real-time systems using statistical workload in...
Zhijian Lu, Yan Zhang, Mircea R. Stan, John Lach, ...