Sciweavers

2796 search results - page 368 / 560
» The coolest path problem
Sort
View
HIPC
2007
Springer
15 years 10 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
DSN
2004
IEEE
15 years 10 months ago
Model Checking Action- and State-Labelled Markov Chains
In this paper we introduce the logic asCSL, an extension of continuous stochastic logic (CSL), which provides powerful means to characterise execution paths of action- and state-l...
Christel Baier, Lucia Cloth, Boudewijn R. Haverkor...
ESA
2006
Springer
77views Algorithms» more  ESA 2006»
15 years 10 months ago
Traversing the Machining Graph
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao W...
APWEB
2003
Springer
15 years 10 months ago
A Web User Profiling Approach
People display regularities in almost everything they do. This paper proposes characteristics of an idealized algorithm that would allow an automatic extraction of web user profil ...
Younes Hafri, Chabane Djeraba, Peter L. Stanchev, ...
COMPGEOM
1987
ACM
15 years 10 months ago
Simplified Voronoi Diagrams
We are interested in Voronoi diagrams as a tool in robot path planning, where the search for a path in an r-dimensional space may be simplified to a search on an (r- l)-dimensional...
John F. Canny, Bruce Randall Donald