Sciweavers

14518 search results - page 220 / 2904
» Two Problems for Sophistication
Sort
View
NMA
2010
14 years 10 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
122
Voted
IWOCA
2010
Springer
223views Algorithms» more  IWOCA 2010»
14 years 7 months ago
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
Konrad Dabrowski, Vadim V. Lozin, Haiko Mülle...
ECAI
2010
Springer
14 years 11 months ago
Local search algorithms on the Stable Marriage Problem: Experimental Studies
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
124
Voted
ALGORITHMICA
2011
14 years 7 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
ICML
2005
IEEE
16 years 1 months ago
Implicit surface modelling as an eigenvalue problem
We discuss the problem of fitting an implicit shape model to a set of points sampled from a co-dimension one manifold of arbitrary topology. The method solves a non-convex optimis...
Christian Walder, Olivier Chapelle, Bernhard Sch&o...