Sciweavers

1026 search results - page 182 / 206
» An Optimal Solution to Room Search Problem
Sort
View
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
14 years 1 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
ICDM
2010
IEEE
228views Data Mining» more  ICDM 2010»
13 years 5 months ago
Multi-label Feature Selection for Graph Classification
Nowadays, the classification of graph data has become an important and active research topic in the last decade, which has a wide variety of real world applications, e.g. drug acti...
Xiangnan Kong, Philip S. Yu
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
14 years 23 days ago
Adapting Representation in Genetic Programming
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....
Cezary Z. Janikow
ISCAS
2003
IEEE
128views Hardware» more  ISCAS 2003»
14 years 20 days ago
Placement with symmetry constraints for analog layout using red-black trees
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
Sarat C. Maruvada, Karthik Krishnamoorthy, Subodh ...
GECCO
2003
Springer
283views Optimization» more  GECCO 2003»
14 years 18 days ago
A Game-Theoretic Memory Mechanism for Coevolution
One problem associated with coevolutionary algorithms is that of forgetting, where one or more previously acquired traits are lost only to be needed later. We introduce a new coevo...
Sevan G. Ficici, Jordan B. Pollack