Sciweavers

2747 search results - page 83 / 550
» Non-oblivious Strategy Improvement
Sort
View
SIGMETRICS
2010
ACM
201views Hardware» more  SIGMETRICS 2010»
15 years 11 months ago
Load balancing via random local search in closed and open systems
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may s...
Ayalvadi Ganesh, Sarah Lilienthal, D. Manjunath, A...
EUROSYS
2007
ACM
16 years 3 months ago
hFS: a hybrid file system prototype for improving small file and metadata performance
Two oft-cited file systems, the Fast File System (FFS) and the Log-Structured File System (LFS), adopt two sharply different update strategies—update-in-place and update-out-of-...
Zhihui Zhang, Kanad Ghose
ISMIS
1999
Springer
15 years 10 months ago
Improving Backtrack Search for SAT by Means of Redundancy
In this paper, a new heuristic that can be grafted to many of the most e cient branching strategies for Davis and Putnam procedures for SAT is described. This heuristic gives a hig...
Laure Brisoux, Éric Grégoire, Lakhda...
ICCAD
1999
IEEE
72views Hardware» more  ICCAD 1999»
15 years 10 months ago
An integrated algorithm for combined placement and libraryless technology mapping
This paper presents a new solution for combining technology mapping with placement, coupling the two into one phase. The original aspects of our work are the use of libraryless ma...
Yanbin Jiang, Sachin S. Sapatnekar
CEC
2011
IEEE
14 years 6 months ago
Simple adaptive cognition for PSO
Abstract—A simple, effective, computationally cheap, and easily tuned method is presented for improving PSO performance by automatically adapting acceleration coefficients. Whil...
Christopher K. Monson