Sciweavers

6740 search results - page 147 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
145
Voted
OWLED
2008
15 years 4 months ago
Representing Product Designs Using a Description Graph Extension to OWL 2
Product development requires the ability to check design consistency, to verify design properties, and to answer questions about a design's possible implementations. These tas...
Henson Graves
MFCS
1994
Springer
15 years 7 months ago
A Competitive Analysis of the List Update Problem with Lookahead
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present re...
Susanne Albers
SIAMAM
2000
119views more  SIAMAM 2000»
15 years 3 months ago
The "Linear" Limit of Thin Film Flows as an Obstacle-Type Free Boundary Problem
We study the limit as n 0 of the nonnegative, self-similar source-type solutions of the thin film equation ut + (unuxxx)x = 0. We obtain a unique limiting function u, which is a s...
Fernando Quirós, Francisco Bernis, Josephus...
ORL
2007
112views more  ORL 2007»
15 years 2 months ago
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
We analyze a simple and natural on-line algorithm (dispatch policy) for a dynamic multiperiod uncapacitated routing problem, in which at the beginning of each time period a set of...
Enrico Angelelli, Martin W. P. Savelsbergh, Maria ...
GD
2004
Springer
15 years 8 months ago
The Metro Map Layout Problem
We initiate a new problem of automatic metro map layout. In general, a metro map consists of a set of lines which have intersections or overlaps. We define a set of aesthetic crit...
Seok-Hee Hong, Damian Merrick, Hugo A. D. do Nasci...