Sciweavers

2725 search results - page 183 / 545
» Constraint Solving for Interpolation
Sort
View
DISOPT
2008
93views more  DISOPT 2008»
15 years 4 months ago
Exploiting planarity in separation routines for the symmetric traveling salesman problem
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
Adam N. Letchford, Nicholas A. Pearson
ANOR
2002
99views more  ANOR 2002»
15 years 4 months ago
A General Approach to the Physician Rostering Problem
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
Louis-Martin Rousseau, Gilles Pesant, Michel Gendr...
CONSTRAINTS
1998
120views more  CONSTRAINTS 1998»
15 years 4 months ago
Constrained Graph Layout
Most current graph layout technology does not lend itself to interactive applications such as animation or advanced user interfaces. We introduce the constrained graph layout model...
Weiqing He, Kim Marriott
TROB
2008
121views more  TROB 2008»
15 years 3 months ago
A Relational Positioning Methodology for Robot Task Specification and Execution
Abstract--This paper presents a relational positioning methodology that allows to restrict totally or partially the movements of an object by specifying its allowed positions in te...
Adolfo Rodriguez, Luis Basañez, Enric Celay...
ICASSP
2011
IEEE
14 years 8 months ago
Joint bandwidth and power allocation in cognitive radio networks under fading channels
A problem of joint optimal bandwidth and power allocation in cognitive networks under fading channels is considered. It is assumed that multiple secondary users (SUs) share the sp...
Xiaowen Gong, Sergiy A. Vorobyov, Chintha Tellambu...