206 search results - page 24 / 42 » A branch-and-bound algorithm for hard multiple knapsack prob... |
65
Voted
ICCV
2003
IEEE
15 years 2 months ago
2003
IEEE
The perception of transparent objects from images is known to be a very hard problem in vision. Given a single image, it is difficult to even detect the presence of transparent o...
105
click to vote
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) that can automatically acquire, evolve and re-use partial solutions in the for...
DSN
2003
IEEE
15 years 2 months ago
2003
IEEE
Energy constrained complex real-time systems are becoming increasingly important in defense, space, and consumer applications. In this paper, we present a sensible heuristic to ad...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...
159
click to vote
CEC
2003
IEEE
13 years 3 months ago
2003
IEEE
Exploration efficiency of GAs largely depends on parameter values. But, it is hard to manually adjust these values. To cope with this problem, several adaptive GAs which automatica...