Sciweavers

105 search results - page 2 / 21
» A Fast Algorithm for Moving Interface Problems
Sort
View
HM
2005
Springer
140views Optimization» more  HM 2005»
13 years 10 months ago
Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows
Abstract. This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejec...
Herman Sontrop, Pieter van der Horn, Marc Uetz
VRML
1997
ACM
13 years 9 months ago
QOTA: A Fast, Multi-Purpose Algorithm for Terrain Following in Virtual Environments
To keep avatars and other moving objects on the ground in virtual environments, it is necessary to find the points where these objects should contact the terrain. This is often do...
John W. Barrus, Richard C. Waters
ICCV
1999
IEEE
14 years 7 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
ANOR
2011
117views more  ANOR 2011»
12 years 9 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
CVPR
2000
IEEE
13 years 9 months ago
Provably Fast Algorithms for Contour Tracking
A new tracker is presented. Two sets are identified: one which contains all possible curves as found in the image, and a second which contains all curves which characterize the o...
Daniel Freedman, Michael S. Brandstein