2252 search results - page 59 / 451 » Lower Bounds for Dynamic Algorithms |
CGO
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper, we present a technique for reducing the overhead of collecting path profiles in the context of a dynamic optimizer. The key idea to our approach, called Targeted Pa...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
ISCC
2005
IEEE
14 years 1 months ago
2005
IEEE
The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model...
TCS
1998
13 years 7 months ago
1998
This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some result...