1578 search results - page 218 / 316 » Direct Routing: Algorithms and Complexity |
HCW
1999
IEEE
14 years 2 months ago
1999
IEEE
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...
MINAR
1998
Springer
14 years 2 months ago
1998
Springer
SimilarityIndexing is very importantfor content-basedretrieval on large multimedia databases, and the "tightness"of data set envelope is a factor that influences the perf...
FSTTCS
2008
Springer
13 years 11 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
ENTCS
2008
13 years 10 months ago
2008
In this paper we define nQML, a functional quantum programming language that follows the "quantum data and control" paradigm. In comparison to Altenkirch and Grattage�...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract— We consider power allocation algorithms for fixedrate transmission over Nakagami-m non-ergodic block-fading channels with perfect transmitter and receiver channel stat...