Sciweavers

11547 search results - page 265 / 2310
» Quantum computing and communication
Sort
View
JSSPP
2010
Springer
15 years 4 months ago
Proposal and Evaluation of APIs for Utilizing Inter-Core Time Aggregation Scheduler
This paper proposes and evaluates APIs for Inter-Core Time Aggregation Scheduler (IAS), which is a kernel-level thread scheduler to enhance performances of multi-threaded programs ...
Satoshi Yamada, Shigeru Kusakabe
CORR
2012
Springer
183views Education» more  CORR 2012»
14 years 2 months ago
Learning Determinantal Point Processes
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
Alex Kulesza, Ben Taskar
ICCS
2004
Springer
15 years 12 months ago
Local Search with Congestion in Complex Communication Networks
We present a formalism that is able to cope with search and congestion simultaneously. This formalism avoids the problem of simulating the dynamics of the search-communication proc...
Alex Arenas, Leon Danon, Albert Díaz-Guiler...
STOC
1992
ACM
91views Algorithms» more  STOC 1992»
15 years 10 months ago
Randomized versus Nondeterministic Communication Complexity
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
Paul Beame, Joan Lawry
ORL
2006
98views more  ORL 2006»
15 years 6 months ago
The communication complexity of private value single-item auctions
This paper is concerned with information revelation in single-item auctions. We compute how much data needs to be transmitted in three strategically equivalent auctions--the Vickr...
Elena Grigorieva, P. Jean-Jacques Herings, Rudolf ...