Sciweavers

1822 search results - page 281 / 365
» The Method of Assigning Incidences
Sort
View
CP
2007
Springer
15 years 5 months ago
On Inconsistent Clause-Subsets for Max-SAT Solving
Recent research has focused on using the power of look-ahead to speed up the resolution of the Max-SAT problem. Indeed, look-ahead techniques such as Unit Propagation (UP) allow to...
Sylvain Darras, Gilles Dequen, Laure Devendeville,...
TAMC
2010
Springer
15 years 5 months ago
Binary De Bruijn Partial Words with One Hole
In this paper, we investigate partial words, or finite sequences that may have some undefined positions called holes, of maximum subword complexity. The subword complexity functi...
Francine Blanchet-Sadri, Jarett Schwartz, Slater S...
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
15 years 5 months ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
Philipp Rohlfshagen, John A. Bullinaria
117
Voted
HOTOS
2007
IEEE
15 years 5 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
HRI
2007
ACM
15 years 5 months ago
Learning by demonstration with critique from a human teacher
Learning by demonstration can be a powerful and natural tool for developing robot control policies. That is, instead of tedious hand-coding, a robot may learn a control policy by ...
Brenna Argall, Brett Browning, Manuela M. Veloso