2434 search results - page 145 / 487 » Algorithmic Randomness of Closed Sets |
208
click to vote
CJ
2011
14 years 7 months ago
2011
Ad Hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use Multipath routing where packets (voice/video/â...
109
click to vote
IPL
2006
15 years 3 months ago
2006
We propose an adaptive algorithm Adaptmin to create perfectly periodic schedules. A perfectly periodic schedule schedules a client regularly after a predefined amount of time known...
102
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
This paper tackles the problem of fitting multiple instances of a model to data corrupted by noise and outliers. The proposed solution is based on random sampling and conceptual da...
123
click to vote
EOR
2010
15 years 3 months ago
2010
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
135
click to vote
AUSAI
2005
Springer
15 years 9 months ago
2005
Springer
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...