Sciweavers

4860 search results - page 760 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
16 years 1 months ago
Characterizing the genetic programming environment for fifth (GPE5) on a high performance computing cluster
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
Kenneth Holladay
KI
2009
Springer
16 years 1 months ago
Constraint-Based Integration of Plan Tracking and Prognosis for Autonomous Production
Today’s complex production systems allow to simultaneously build different products following individual production plans. Such plans may fail due to component faults or unfores...
Paul Maier, Martin Sachenbacher, Thomas Rühr,...
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
16 years 1 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
ICDM
2008
IEEE
99views Data Mining» more  ICDM 2008»
16 years 28 days ago
Finding Good Itemsets by Packing Data
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
Nikolaj Tatti, Jilles Vreeken
ICRA
2008
IEEE
204views Robotics» more  ICRA 2008»
16 years 27 days ago
Active exploration and keypoint clustering for object recognition
— Object recognition is a challenging problem for artificial systems. This is especially true for objects that are placed in cluttered and uncontrolled environments. To challenge...
Gert Kootstra, Jelmer Ypma, Bart de Boer