Sciweavers

1139 search results - page 83 / 228
» Bounded Ideation Theory
Sort
View
SAGT
2009
Springer
108views Game Theory» more  SAGT 2009»
14 years 3 months ago
On the Planner's Loss Due to Lack of Information in Bayesian Mechanism Design
In this paper we study a large class of resource allocation problems with an important complication, the utilization cost of a given resource is private information of a profit ma...
José R. Correa, Nicolas Figueroa
CADE
2002
Springer
14 years 9 months ago
Basic Syntactic Mutation
Modularity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 Michael Abbott, Neil Ghani, and Christoph L?uth Union of Equational Theo...
Christopher Lynch, Barbara Morawska
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
14 years 9 months ago
On metric ramsey-type phenomena
The main question studied in this article may be viewed as a nonlinear analogue of Dvoretzky's theorem in Banach space theory or as part of Ramsey theory in combinatorics. Gi...
Yair Bartal, Nathan Linial, Manor Mendel, Assaf Na...
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
14 years 6 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
FOCS
1999
IEEE
14 years 1 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio