Sciweavers

812 search results - page 45 / 163
» A Complete Guide to the Future
Sort
View
CP
2004
Springer
14 years 3 months ago
Quality of LP-Based Approximations for Highly Combinatorial Problems
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
Lucian Leahu, Carla P. Gomes
MOZ
2004
Springer
14 years 3 months ago
The Oz-E Project: Design Guidelines for a Secure Multiparadigm Programming Language
Abstract. The design and implementation of a capability secure multiparadigm language should be guided from its conception by proven principles of secure language design. In this p...
Fred Spiessens, Peter Van Roy
ICRA
2003
IEEE
133views Robotics» more  ICRA 2003»
14 years 2 months ago
Conflict-free routing of AGVs on the mesh topology based on a discrete-time model
: Automated Guided Vehicles (or AGVs for short) have become an important option in material handling. In many applications, such as container terminals, the service area is often a...
Jianyang Zeng, Wen-Jing Hsu
CPAIOR
2010
Springer
14 years 2 months ago
Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
Madjid Khichane, Patrick Albert, Christine Solnon
SCALESPACE
2001
Springer
14 years 2 months ago
Generic Multi-scale Segmentation and Curve Approximation Method
Abstract. We propose a new complete method to extract significant description(s) of planar curves according to constant curvature segments. This method is based (i) on a multi-sca...
Marielle Mokhtari, Robert Bergevin