Sciweavers

446 search results - page 42 / 90
» Using a genetic algorithm approach to solve the dynamic chan...
Sort
View
FGCS
2010
119views more  FGCS 2010»
13 years 7 months ago
Characterizing fault tolerance in genetic programming
Evolutionary Algorithms, including Genetic Programming (GP), are frequently employed to solve difficult real-life problems, which can require up to days or months of computation. ...
Daniel Lombraña Gonzalez, Francisco Fern&aa...
CIVR
2005
Springer
123views Image Analysis» more  CIVR 2005»
14 years 2 months ago
Region-Based Image Clustering and Retrieval Using Multiple Instance Learning
Multiple Instance Learning (MIL) is a special kind of supervised learning problem that has been studied actively in recent years. We propose an approach based on One-Class Support ...
Chengcui Zhang, Xin Chen
AIMSA
2008
Springer
13 years 10 months ago
DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
Bayo Omomowo, Inés Arana, Hatem Ahriz
GECCO
2005
Springer
189views Optimization» more  GECCO 2005»
14 years 2 months ago
Molecular programming: evolving genetic programs in a test tube
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
Byoung-Tak Zhang, Ha-Young Jang
ICCV
1998
IEEE
14 years 29 days ago
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
Sébastien Roy, Ingemar J. Cox