Sciweavers

1174 search results - page 79 / 235
» Optimizing generics is easy!
Sort
View
CEC
2010
IEEE
13 years 10 months ago
Behavioral diversity measures for Evolutionary Robotics
Abstract— In Evolutionary Robotics (ER), explicitly rewarding for behavioral diversity recently revealed to generate efficient results without recourse to complex fitness funct...
Stéphane Doncieux, Jean-Baptiste Mouret
HEURISTICS
2006
120views more  HEURISTICS 2006»
13 years 10 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
IACR
2011
94views more  IACR 2011»
12 years 9 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
EDBT
2009
ACM
186views Database» more  EDBT 2009»
14 years 4 months ago
Automating the loading of business process data warehouses
Business processes drive the operations of an enterprise. In the past, the focus was primarily on business process design, modeling, and automation. Recently, enterprises have rea...
Malú Castellanos, Alkis Simitsis, Kevin Wil...
ECCV
1996
Springer
14 years 12 months ago
Imposing Hard Constraints on Soft Snakes
An approach is presented for imposing generic hard constraints on deformable models at a low computational cost, while preserving the good convergence properties of snake-like mod...
Pascal Fua, Christian Brechbühler