10988 search results - page 66 / 2198 » Algorithmic Folding Complexity |
SPAA
2006
ACM
14 years 4 months ago
2006
ACM
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
SWAT
2004
Springer
14 years 3 months ago
2004
Springer
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
ICIP
2005
IEEE
14 years 11 months ago
2005
IEEE
Dirty paper trellis codes are a form of watermarking with side information. These codes have the advantage of being invariant to valumetric scaling of the cover Work. However, the...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
In this work we compare the use of a Particle Swarm Optimization (PSO) and a Genetic Algorithm (GA) (both augmented with Support Vector Machines SVM) for the classification of high...