Sciweavers

2569 search results - page 144 / 514
» Approximate Objects and Approximate Theories
Sort
View
CCCG
2008
15 years 7 months ago
The Embroidery Problem
We consider the problem of embroidering a design pattern, given by a graph G, using a single minimum length thread. We give an exact polynomial-time algorithm for the case that G ...
Esther M. Arkin, George Hart, Joondong Kim, Irina ...
DEDS
2010
97views more  DEDS 2010»
15 years 6 months ago
On Regression-Based Stopping Times
We study approaches that fit a linear combination of basis functions to the continuation value function of an optimal stopping problem and then employ a greedy policy based on the...
Benjamin Van Roy
DAM
2008
78views more  DAM 2008»
15 years 6 months ago
Semi-preemptive routing on trees
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
Sven Oliver Krumke, Dirk Räbiger, Rainer Schr...
TCS
2008
15 years 6 months ago
Finding a minimum medial axis of a discrete shape is NP-hard
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
David Coeurjolly, Jérôme Hulin, Isabe...
TCS
2008
15 years 6 months ago
Dense open-shop schedules with release times
We study open-shop scheduling problems with job release times. The objective is to minimize the makespan. Dense schedules, easy to construct, are often used as approximate solutio...
Rongjun Chen, Wanzhen Huang, Guochun Tang