Sciweavers

19130 search results - page 15 / 3826
» Modelling multi-path problems
Sort
View
CVPR
2010
IEEE
14 years 6 months ago
Curious snakes: A minimum latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony J. ...
NMA
2010
14 years 7 months ago
Metaheuristics for the Asymmetric Hamiltonian Path Problem
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
João Pedro Pedroso
HEURISTICS
2010
14 years 4 months ago
A large neighbourhood search approach to the multi-activity shift scheduling problem
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
Claude-Guy Quimper, Louis-Martin Rousseau
JMLR
2010
164views more  JMLR 2010»
14 years 4 months ago
Solving the Uncapacitated Facility Location Problem Using Message Passing Algorithms
The Uncapacitated Facility Location Problem (UFLP) is one of the most widely studied discrete location problems, whose applications arise in a variety of settings. We tackle the U...
Nevena Lazic, Brendan J. Frey, Parham Aarabi
SIAMNUM
2010
96views more  SIAMNUM 2010»
14 years 4 months ago
On the Strong Convergence of Gradients in Stabilized Degenerate Convex Minimization Problems
Infimizing sequences in nonconvex variational problems typically exhibit enforced finer and finer oscillations called microstructures such that the infimal energy is not attained. ...
Wolfgang Boiger, Carsten Carstensen