Sciweavers

481 search results - page 42 / 97
» Martin's game: a lower bound for the number of sets
Sort
View
ALT
2006
Springer
14 years 5 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
SPAA
2005
ACM
14 years 2 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 12 days ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 8 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
SIAMCO
2002
77views more  SIAMCO 2002»
13 years 8 months ago
Robust Optimal Switching Control for Nonlinear Systems
Abstract. We formulate a robust optimal control problem for a general nonlinear system with finitely many admissible control settings and with costs assigned to switching of contro...
Joseph A. Ball, Jerawan Chudoung, Martin V. Day