Sciweavers

1254 search results - page 3 / 251
» Making Hard Problems Harder
Sort
View
FUZZIEEE
2007
IEEE
14 years 3 days ago
Monitoring the State of a Ubiquitous Robotic System: A Fuzzy Logic Approach
— A trend is emerging in the fields of ambient intelligence (AmI) and autonomous robotics, which points in the direction of a merger between these two fields. The inclusion of ...
Donatella Guarino, Alessandro Saffiotti
KDD
2002
ACM
125views Data Mining» more  KDD 2002»
14 years 6 months ago
Pattern discovery in sequences under a Markov assumption
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...
Darya Chudova, Padhraic Smyth
CSR
2007
Springer
13 years 12 months ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
ANOR
2010
123views more  ANOR 2010»
13 years 5 months ago
Nature inspired genetic algorithms for hard packing problems
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...
Philipp Rohlfshagen, John A. Bullinaria
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
13 years 9 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