242 search results - page 10 / 49 » Distributed algorithms with dynamical random transitions |
111
click to vote
PPSN
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
JSAC
2007
14 years 11 months ago
2007
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
ICIAP
1999
ACM
15 years 3 months ago
1999
ACM
The paper presents a new technique of image enhancement. The described algorithm enables the suppression of noise and contrast enhancement. The interesting feature of this new alg...
COMSIS
2010
14 years 9 months ago
2010
According to the different requests of Web and the heterogeneity of Web server, the paper presents a content-based loadbalancing algorithm. The mechanism of this algorithm is that ...
101
Voted
FMICS
2009
Springer
15 years 6 months ago
2009
Springer
We describe a dynamic partitioning scheme usable by model checking techniques that divide the state space into partitions, such as most external memory and distributed model checki...