Sciweavers

10493 search results - page 236 / 2099
» Dynamic Word Problems
Sort
View
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
14 years 1 months ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
ICCV
1998
IEEE
14 years 18 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
ECAI
1992
Springer
14 years 12 days ago
Towards a Cooperation Knowledge Level For Collaborative Problem Solving
The cooperation knowledge level is a new computer level specifically for multi-agent problem solvers which describes rich and explicit models of common social phenomena. A cooperat...
Nicholas R. Jennings
ATAL
2006
Springer
14 years 2 days ago
An agent based general solution model for the course timetabling problem
This paper proposes a general solution model using agent technology in order to solve two critical open issues in the course timetabling problem: application-specific issues and d...
Yan Yang, Raman Paranjape, Luigi Benedicenti
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
13 years 12 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom