Sciweavers

18306 search results - page 78 / 3662
» Algorithmics in Exponential Time
Sort
View
COLT
2006
Springer
15 years 1 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
15 years 2 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
GECCO
2003
Springer
109views Optimization» more  GECCO 2003»
15 years 3 months ago
Real Royal Road Functions for Constant Population Size
Evolutionary and genetic algorithms (EAs and GAs) are quite successful randomized function optimizers. This success is mainly based on the interaction of different operators like ...
Tobias Storch, Ingo Wegener
ECAI
2006
Springer
15 years 1 months ago
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
Radu Marinescu 0002, Rina Dechter
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
15 years 7 months ago
Deletion Without Rebalancing in Balanced Binary Trees
We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect delet...
Siddhartha Sen, Robert E. Tarjan