Sciweavers

101 search results - page 16 / 21
» An Exact Quantum Polynomial-Time Algorithm for Simon's Probl...
Sort
View
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
13 years 12 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
JCSS
2008
120views more  JCSS 2008»
13 years 7 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
14 years 24 days ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
ICRA
2003
IEEE
118views Robotics» more  ICRA 2003»
14 years 25 days ago
Capturing a convex object with three discs
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...
Jeff Erickson, Shripad Thite, Fred Rothganger, Jea...
CORR
2011
Springer
261views Education» more  CORR 2011»
13 years 2 months ago
Convex and Network Flow Optimization for Structured Sparsity
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...