2479 search results - page 353 / 496 » Quantum complexity theory |
165
click to vote
PODC
2005
ACM
16 years 1 days ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
183
click to vote
PPOPP
2005
ACM
16 years 1 days ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
167
click to vote
SPAA
2005
ACM
16 years 1 days ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
159
click to vote
ATAL
2005
Springer
16 years 16 hour ago
2005
Springer
In the design of resource bounded agents, high-level cognitive activities, such as reasoning, raise important problems related both to the adaptive ability and to the computationa...
180
click to vote
COCOON
2005
Springer
16 years 10 hour ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...