13214 search results - page 377 / 2643 » Pseudorandomness for network algorithms |
182
Voted
ICOIN
2004
Springer
16 years 6 days ago
2004
Springer
In this paper, we present a new method to calculate reinforcement value in QoS routing algorithm for real-time multimedia based on Ant algorithm to efficiently and effectively rein...
177
click to vote
FTDCS
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper deals with the problem of scheduling aperiodic groups of tasks in distributed systems. It proposes two contributions, namely: i) a distributed scheduling algorithm to b...
211
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
176
click to vote
CORR
1998
Springer
15 years 6 months ago
1998
Springer
A new training algorithm is presented for delayed reinforcement learning problems that does not assume the existence of a critic model and employs the polytope optimization algorit...
228
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...