2313 search results - page 382 / 463 » On Heuristic Time Hierarchies |
141
click to vote
COR
2010
15 years 6 months ago
2010
This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and paralle...
152
click to vote
COGSCI
2008
15 years 6 months ago
2008
Griffiths and Tenenbaum (2006) asked individuals to make predictions about the duration or extent of everyday events (e.g., cake baking times), and reported that predictions were ...
194
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
167
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
151
click to vote
EOR
2010
15 years 6 months ago
2010
Solving large-scale p-median problems is usually time consuming. People often aggregate the demand points in a large-scale p-median problem to reduce its problem size and make it ...