Sciweavers

5964 search results - page 1183 / 1193
» A theory of speculative computation
Sort
View
QUESTA
2007
136views more  QUESTA 2007»
13 years 9 months ago
A resource allocation queueing fairness measure: properties and bounds
Fairness is an inherent and fundamental factor of queue service disciplines in a large variety of queueing applications, ranging from airport and supermarket waiting lines to comp...
Benjamin Avi-Itzhak, Hanoch Levy, David Raz
ICDT
2010
ACM
137views Database» more  ICDT 2010»
13 years 8 months ago
A Greedy Algorithm for Constructing a Low-Width Generalized Hypertree Decomposition
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
Kaoru Katayama, Tatsuro Okawara, Yuka Itou
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 8 months ago
Approximate Nash Equilibria under Stability Conditions
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
Maria-Florina Balcan, Mark Braverman
JACM
2010
137views more  JACM 2010»
13 years 8 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati
JAIR
2010
106views more  JAIR 2010»
13 years 8 months ago
Cooperative Games with Overlapping Coalitions
In the usual models of cooperative game theory, the outcome of a coalition formation process is either the grand coalition or a coalition structure that consists of disjoint coali...
Georgios Chalkiadakis, Edith Elkind, Evangelos Mar...
« Prev « First page 1183 / 1193 Last » Next »