4114 search results - page 126 / 823 » Efficient Algorithms for the 2-Center Problems |
133
click to vote
CAV
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
153
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single ...
129
click to vote
SWAT
1998
Springer
15 years 9 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
140
click to vote
COR
2010
15 years 5 months ago
2010
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...
124
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
We propose a model-based learning algorithm, the Adaptive Aggregation Algorithm (AAA), that aims to solve the online, continuous state space reinforcement learning problem in a de...