963 search results - page 89 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
104
click to vote
ETT
2002
14 years 11 months ago
2002
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
ECCV
2002
Springer
16 years 1 months ago
2002
Springer
Establishing point correspondences between images is a key step for 3D-shape computation. Nevertheless, shape extraction and point correspondence are treated, usually, as two diffe...
SIGMETRICS
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
DCC
2006
IEEE
15 years 11 months ago
2006
IEEE
In this work we consider the problem of universal prediction of individual sequences where the universal predictor is a deterministic finite state machine, with a fixed, relativel...