817 search results - page 131 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
COMPGEOM
2003
ACM
14 years 25 days ago
2003
ACM
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
TITB
2008
13 years 7 months ago
2008
Intravascularultrasound (IVUS) sequences recorded in vivo are subject to a wide array of motion artifacts as the majority of these studies are performed within the coronary arterie...
DAC
1999
ACM
14 years 8 months ago
1999
ACM
In this paper, we establish a theoretical framework for a new concept of scheduling called soft scheduling. In contrasts to the traditional schedulers referred as hard schedulers,...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
TPDS
2010
13 years 6 months ago
2010
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...