4112 search results - page 110 / 823 » Efficient Algorithms for the Spoonerism Problem |
127
click to vote
CAV
2005
Springer
15 years 9 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...
140
click to vote
GECCO
2007
Springer
15 years 10 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 ...
121
click to vote
SWAT
1998
Springer
15 years 8 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 ...
137
click to vote
COR
2010
15 years 4 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...
133
click to vote
FUIN
2006
15 years 4 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...