883 search results - page 130 / 177 » A Genetic Algorithm Applied to the Maximum Flow Problem |
147
click to vote
IEEESCC
2009
IEEE
15 years 10 days ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
126
click to vote
ICCTA
2007
IEEE
15 years 8 months ago
2007
IEEE
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
123
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
138
Voted
KES
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. The aim of this work is to forecast future events in financial data sets, in particular, we focus our attention on situations where positive instances are rare, which fal...
132
click to vote
CF
2008
ACM
15 years 4 months ago
2008
ACM
Volunteer Computing (VC) is a paradigm that takes advantage of idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale...