1578 search results - page 218 / 316 » Direct Routing: Algorithms and Complexity |
127
click to vote
HCW
1999
IEEE
15 years 8 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...
123
Voted
MINAR
1998
Springer
15 years 8 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...
115
click to vote
FSTTCS
2008
Springer
15 years 5 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 ...
152
click to vote
ENTCS
2008
15 years 4 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�...
107
click to vote
CORR
2007
Springer
15 years 4 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...