Sciweavers

14739 search results - page 203 / 2948
» An optimization problem on the sphere
Sort
View
TEC
2002
163views more  TEC 2002»
14 years 10 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
99
Voted
ATMOS
2010
308views Optimization» more  ATMOS 2010»
14 years 10 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
IEEECIT
2010
IEEE
14 years 9 months ago
Non-recursive Algorithm of Tower of Hanoi Problem
—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...
Fuwan Ren, Qifan Yang, Jiexin Zheng, Hui Yan
CDC
2009
IEEE
147views Control Systems» more  CDC 2009»
14 years 8 months ago
The asymmetric sinistral/dextral Markov-Dubins problem
Abstract-- We consider a variation of the classical MarkovDubins problem dealing with curvature-constrained, shortest paths in the plane with prescribed initial and terminal positi...
Efstathios Bakolas, Panagiotis Tsiotras
TSMC
2010
14 years 5 months ago
A Mathematical Programming Solution to the Mars Express Memory Dumping Problem
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...
Giovanni Righini, Emanuele Tresoldi