388 search results - page 35 / 78 » Discrete Hamilton-Jacobi theory and discrete optimal control |
138
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
192
click to vote
ICNC
2009
Springer
15 years 10 months ago
2009
Springer
Vehicle routing problem (VRP) is a well-known combinatorial optimization and nonlinear programming problem seeking to service a number of customers with a fleet of vehicles. This ...
157
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
137
click to vote
NIPS
2007
15 years 7 months ago
2007
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
221
click to vote
FOGA
2011
14 years 9 months ago
2011
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...