Sciweavers

1639 search results - page 87 / 328
» Anytime Heuristic Search
Sort
View
LCPC
2005
Springer
15 years 6 months ago
A Systematic Approach to Model-Guided Empirical Search for Memory Hierarchy Optimization
The goal of this work is a systematic approach to compiler optimization for simultaneously optimizing across multiple levels of the memory hierarchy. Our approach combines compiler...
Chun Chen, Jacqueline Chame, Mary W. Hall, Kristin...
82
Voted
CP
2009
Springer
15 years 7 months ago
Exploiting Problem Decomposition in Multi-objective Constraint Optimization
Multi-objective optimization is concerned with problems involving multiple measures of performance which should be optimized simultaneously. In this paper, we extend AND/OR Branch-...
Radu Marinescu
127
Voted
AMAI
2004
Springer
15 years 6 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
114
Voted
COR
2006
80views more  COR 2006»
15 years 19 days ago
Multiple crossdocks with inventory and time windows
Crossdocking studies have mostly been concerned with the physical layout of a crossdock or on a single crossdock. In this work, we study a network of crossdocks taking into consid...
Ping Chen, Yunsong Guo, Andrew Lim, Brian Rodrigue...
109
Voted
SBP
2011
Springer
14 years 7 months ago
Ranking Information in Networks
Given a network, we are interested in ranking sets of nodes that score highest on user-specified criteria. For instance in graphs from bibliographic data (e.g. PubMed), we would l...
Tina Eliassi-Rad, Keith Henderson