Sciweavers

697 search results - page 107 / 140
» Convex Functions on Discrete Sets
Sort
View
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
15 years 9 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
IFIP12
2008
15 years 7 months ago
Optimizing Relationships Information in Repertory Grids
The Repertory Grid method is widely used in knowledge engineering to infer functional relationships between constructs given by an expert. The method is ignoring information that c...
Enrique Calot, Paola Britos, Ramón Garc&iac...
ECCV
2002
Springer
16 years 7 months ago
Real-Time Interactive Path Extraction with on-the-Fly Adaptation of the External Forces
The aim of this work is to propose an adaptation of optimal path based interactive tools for image segmentation (related to Live-Wire [12] and Intelligent Scissors [18] approaches)...
Olivier Gérard, Thomas Deschamps, Myriam Gr...
ICNSC
2008
IEEE
16 years 5 days ago
Facility Location Optimization via Multi-Agent Robotic Systems
— A facility location problem deals with locating the best place for a group of facilities, among distinct demand points, minimizing a certain locational optimization function. I...
Miad Moarref, Hassan Sayyadi
ICIP
2007
IEEE
16 years 1 days ago
Steganalyzing Texture Images
A texture image is of noisy nature in its spatial representation. As a result, the data hidden in texture images, in particular in raw texture images, are hard to detect with curr...
Chunhua Chen, Yun Q. Shi, Guorong Xuan