Sciweavers

1195 search results - page 36 / 239
» An Inventory-Location Model: Formulation, Solution Algorithm...
Sort
View
AAAI
1994
13 years 10 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
ICIG
2009
IEEE
13 years 6 months ago
Statistical Modeling of Optical Flow
Optical flow estimation is one of the main subjects in computer vision. Many methods developed to compute the motion fields are built using standard heuristic formulation. In this...
Dongmin Ma, Véronique Prinet, Cyril Cassisa
TEC
2002
117views more  TEC 2002»
13 years 8 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna
GMP
2006
IEEE
137views Solid Modeling» more  GMP 2006»
14 years 2 months ago
Theoretically Based Robust Algorithms for Tracking Intersection Curves of Two Deforming Parametric Surfaces
Abstract. This paper presents the mathematical framework, and develops algorithms accordingly, to continuously and robustly track the intersection curves of two deforming parametri...
Xianming Chen, Richard F. Riesenfeld, Elaine Cohen...
ICIP
2006
IEEE
14 years 10 months ago
Spatially Constrained Wiener Filter with Markov Autocorrelation Modeling for Image Resolution Enhancement
This paper develops a practical method for image resolution enhancement. The method optimizes the spatially constrained Wiener filter for an efficiently parameterized model of the...
Jiazheng Shi, Stephen E. Reichenbach