239 search results - page 8 / 48 » A Simple Algorithm for Computing the Lempel Ziv Factorizatio... |
GECCO
2005
Springer
14 years 27 days ago
2005
Springer
Cooperative co-evolution is often used to solve difficult optimization problems by means of problem decomposition. Its performance for such tasks can vary widely from good to disa...
CSCW
2012
ACM
12 years 3 months ago
2012
ACM
Users have come to rely on automated route finding services for driving, public transit, walking, and bicycling. Current state of the art route finding algorithms typically rely...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper, a new fast Hartley transform (FHT) algorithmradix-22 suitable for pipeline implementation of the discrete Hartley transform (DHT) is presented. The proposed algorit...
ICALP
2003
Springer
14 years 17 days ago
2003
Springer
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...