Sciweavers

1559 search results - page 181 / 312
» Some Group Theory Problems
Sort
View
LPNMR
2009
Springer
15 years 4 months ago
The Complexity of Circumscriptive Inference in Post's Lattice
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
Michael Thomas
SAGT
2009
Springer
131views Game Theory» more  SAGT 2009»
15 years 4 months ago
The Computational Complexity of Weak Saddles
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
Felix Brandt, Markus Brill, Felix A. Fischer, Jan ...
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
SYNASC
2006
IEEE
91views Algorithms» more  SYNASC 2006»
15 years 4 months ago
MATHsAiD: A Mathematical Theorem Discovery Tool
In the eld of automated reasoning, one of the most challenging (even if, perhaps, somewhat overlooked) problems thus far has been to develop a means of discerning, from amongst al...
Roy L. McCasland, Alan Bundy
MMB
2004
Springer
175views Communications» more  MMB 2004»
15 years 3 months ago
Sensitivity Analysis for MAP/MAP/1 Queues
A sensitivity analysis of a single-server, infinite-buffer queue with correlated arrivals and correlated service times is performed. We study and compare the isolated impact of (...
Armin Heindl