101 search results - page 10 / 21 » An Exact Quantum Polynomial-Time Algorithm for Simon's Probl... |
SIAMJO
2008
13 years 7 months ago
2008
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
ASIAN
2003
Springer
14 years 24 days ago
2003
Springer
Predicate detection is an important problem in distributed systems. Based on the temporal interactions of intervals, there exists a rich class of modalities under which global pred...
WG
2004
Springer
14 years 27 days ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
INFOCOM
2003
IEEE
14 years 25 days ago
2003
IEEE
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...