Sciweavers

2634 search results - page 3 / 527
» Faster Than Uppaal
Sort
View
USENIX
2003
13 years 8 months ago
Operating System I/O Speculation: How Two Invocations Are Faster Than One
We present an in-kernel disk prefetcher which uses speculative execution to determine what data an application is likely to require in the near future. By placing our design withi...
Keir Faser, Fay Chang
ALGORITHMICA
2008
42views more  ALGORITHMICA 2008»
13 years 7 months ago
Solving Connected Dominating Set Faster than 2 n
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
CPC
2011
240views Education» more  CPC 2011»
12 years 11 months ago
Many Random Walks Are Faster Than One
Noga Alon, Chen Avin, Michal Koucký, Gady K...
GECCO
2003
Springer
103views Optimization» more  GECCO 2003»
14 years 20 days ago
Are Multiple Runs of Genetic Algorithms Better than One?
Abstract. There are conflicting reports over whether multiple independent runs of genetic algorithms (GAs) with small populations can reach solutions of higher quality or can fin...
Erick Cantú-Paz, David E. Goldberg
FPGA
2008
ACM
174views FPGA» more  FPGA 2008»
13 years 9 months ago
When FPGAs are better at floating-point than microprocessors
It has been shown that FPGAs could outperform high-end microprocessors on floating-point computations thanks to massive parallelism. However, most previous studies re-implement in...
Florent de Dinechin, Jérémie Detrey,...