Sciweavers

2109 search results - page 164 / 422
» Solving Necklace Constraint Problems
Sort
View
INFORMS
2008
55views more  INFORMS 2008»
15 years 6 months ago
Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations
Most traditional routing problems assume perfect operability of all arcs and nodes. However, when independent arc failure probabilities exist, a secondary objective must be presen...
April K. Andreas, J. Cole Smith
ICTAI
2002
IEEE
15 years 11 months ago
On Temporal Planning as CSP
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
Amol Dattatraya Mali
CEC
2009
IEEE
16 years 1 months ago
Performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on the CEC09 test problems
— In this paper, the performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on a set of bound-constrained synthetic test problems is reported. The hybr...
Santosh Tiwari, Georges Fadel, Patrick Koch, Kalya...
JMIV
2008
106views more  JMIV 2008»
15 years 6 months ago
Estimation of Vector Fields in Unconstrained and Inequality Constrained Variational Problems for Segmentation and Registration
Vector fields arise in many problems of computer vision, particularly in non-rigid registration. In this paper, we develop coupled partial differential equations (PDEs) to estimat...
Gozde B. Unal, Greg G. Slabaugh
EOR
2007
89views more  EOR 2007»
15 years 6 months ago
The service allocation problem at the Gioia Tauro Maritime Terminal
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
Jean-François Cordeau, Manlio Gaudioso, Gil...