Sciweavers

719 search results - page 55 / 144
» Adaptive Online Time Allocation to Search Algorithms
Sort
View
JSAT
2008
99views more  JSAT 2008»
14 years 9 months ago
A Switching Criterion for Intensification and Diversification in Local Search for SAT
We propose a new switching criterion, namely the evenness or unevenness of the distribution of variable weights, and use this criterion to combine intensification and diversificat...
Wanxia Wei, Chu Min Li, Harry Zhang
ESA
2006
Springer
96views Algorithms» more  ESA 2006»
15 years 1 months ago
Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
Brian C. Dean, Michel X. Goemans, Nicole Immorlica
SIGMETRICS
1997
ACM
117views Hardware» more  SIGMETRICS 1997»
15 years 2 months ago
Informed Multi-Process Prefetching and Caching
Informed prefetching and caching based on application disclosure of future I/O accesses (hints) can dramatically reduce the execution time of I/O-intensive applications. A recent ...
Andrew Tomkins, R. Hugo Patterson, Garth A. Gibson
WAIM
2005
Springer
15 years 3 months ago
Research Paper Recommender Systems: A Subspace Clustering Approach
Researchers from the same lab often spend a considerable amount of time searching for published articles relevant to their current project. Despite having similar interests, they c...
Nitin Agarwal, Ehtesham Haque, Huan Liu, Lance Par...
SEAL
1998
Springer
15 years 2 months ago
Automating Space Allocation in Higher Education
The allocation of office space in any large institution is usually a problematical issue, which often demands a substantial amount of time to perform manually. The result of this a...
Edmund K. Burke, D. B. Varley