Sciweavers

976 search results - page 64 / 196
» The Complexity of Timetable Construction Problems
Sort
View
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
14 years 2 months ago
Quality-time analysis of multi-objective evolutionary algorithms
A quality-time analysis of multi-objective evolutionary algorithms (MOEAs) based on schema theorem and building blocks hypothesis is developed. A bicriteria OneMax problem, a hypo...
Jian-Hung Chen, Shinn-Ying Ho, David E. Goldberg
KDD
2009
ACM
175views Data Mining» more  KDD 2009»
14 years 1 months ago
Multi-class protein fold recognition using large margin logic based divide and conquer learning
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...
Huma Lodhi, Stephen Muggleton, Michael J. E. Stern...
DCC
2005
IEEE
14 years 8 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
KES
2008
Springer
13 years 9 months ago
Instruction-based development: From evolution to generic structures of digital circuits
Evolutionary techniques provide powerful tools to design novel solutions for hard problems in different areas. However, the problem of scale (i.e. how to create a large, complex s...
Michal Bidlo, Jaroslav Skarvada
CORR
2011
Springer
178views Education» more  CORR 2011»
13 years 4 months ago
Anytime Reliable Codes for Stabilizing Plants over Erasure Channels
—The problem of stabilizing an unstable plant over a noisy communication link is an increasingly important one that arises in problems of distributed control and networked contro...
Ravi Teja Sukhavasi, Babak Hassibi