Sciweavers

925 search results - page 10 / 185
» A Solution to the Extended GCD Problem
Sort
View
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
12 years 11 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache
ICRA
2006
IEEE
85views Robotics» more  ICRA 2006»
14 years 1 months ago
Extended EM for Planar Approximation of 3D Data
– The paper deals with fitting of planar patches to 3D laser range data obtained by a mobile robot. The number and the initial position of the patches are unknown, hence their es...
Rolf Lakämper, Longin Jan Latecki
OOPSLA
1998
Springer
13 years 12 months ago
Data Groups: Specifying the Modification of Extended State
This paper explores the interpretation of specifications in the context of an object-oriented programming language with subclassing and method overrides. In particular, the paper ...
K. Rustan M. Leino
ECAI
2004
Springer
14 years 1 months ago
Robust Solutions for Constraint Satisfaction and Optimization
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
Emmanuel Hebrard, Brahim Hnich, Toby Walsh
ICCV
2009
IEEE
15 years 20 days ago
Extending Continuous Cuts: Anisotropic Metrics and Expansion Moves
The concept of graph cuts is by now a standard method for all sorts of low level vision problems. Its popularity is largely due to the fact that globally or near globally optimal...
Carl Olsson, Martin Byr¨od, Niels Chr. Overgaard,...