Sciweavers

5995 search results - page 885 / 1199
» Algorithmic Game Theory
Sort
View
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 6 months ago
The Equivalence of Sampling and Searching
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
Scott Aaronson
DM
2006
128views more  DM 2006»
15 years 6 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
INFORMATICALT
2006
89views more  INFORMATICALT 2006»
15 years 6 months ago
Investigation of Examples of E-Education Environment for Scientific Collaboration and Distance Graduate Studies, Part 1
The objective is to investigate two emerging information technologies in graduate studies and scientific cooperation. Internet is the first technology. The open source is the secon...
Jonas Mockus
MST
2006
149views more  MST 2006»
15 years 6 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...