Sciweavers

14165 search results - page 472 / 2833
» The generalized two-server problem
Sort
View
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
16 years 4 months ago
BQP and the Polynomial Hierarchy
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
Scott Aaronson
CPAIOR
2009
Springer
16 years 1 months ago
Backdoors to Combinatorial Optimization: Feasibility and Optimality
There has been considerable interest in the identification of structural properties of combinatorial problems that lead, directly or indirectly, to the development of efficient al...
Bistra N. Dilkina, Carla P. Gomes, Yuri Malitsky, ...
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
16 years 26 days ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner
IAT
2005
IEEE
16 years 16 days ago
Coordinating Non Cooperative Planning Agents: Complexity Results
Whenever independent, non-cooperative actors jointly have to solve a complex task, they need to coordinate their efforts. Typical examples of such task coordination problems are s...
Adriaan ter Mors, Cees Witteveen
MM
2005
ACM
145views Multimedia» more  MM 2005»
16 years 14 days ago
Multiple instance learning for labeling faces in broadcasting news video
Labeling faces in news video with their names is an interesting research problem which was previously solved using supervised methods that demand significant user efforts on lab...
Jun Yang 0003, Rong Yan, Alexander G. Hauptmann