16504 search results - page 336 / 3301 » New Problems, New Solutions |
170
click to vote
IDA
2008
Springer
15 years 6 months ago
2008
Springer
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...
146
Voted
SWAT
2004
Springer
16 years 2 days ago
2004
Springer
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
198
click to vote
AIPS
2011
14 years 10 months ago
2011
Research in efficient methods for solving infinite-horizon MDPs has so far concentrated primarily on discounted MDPs and the more general stochastic shortest path problems (SSPs...
182
click to vote
SIGMOD
1996
ACM
15 years 11 months ago
1996
ACM
Object-Relational and Object-Oriented DBMSs allow users to invoke time-consuming ("expensive") methods in their queries. When queries containing these expensive methods a...
175
click to vote
EOR
2006
15 years 6 months ago
2006
This paper presents a new multi-depot combined vehicle and crew scheduling algorithm, and uses it, in conjunction with a heuristic vehicle routing algorithm, to solve the intra-ci...