Sciweavers

1007 search results - page 130 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
SIGMOD
2007
ACM
120views Database» more  SIGMOD 2007»
16 years 2 months ago
Xpath on steroids: exploiting relational engines for xpath performance
A lot of research has been conducted by the database community on methods and techniques for efficient XPath processing, with great success. Despite the progress made, significant...
Haris Georgiadis, Vasilis Vassalos
SOFSEM
2000
Springer
15 years 6 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
125
Voted
ICML
1998
IEEE
16 years 3 months ago
Q2: Memory-Based Active Learning for Optimizing Noisy Continuous Functions
This paper introduces a new algorithm, Q2, foroptimizingthe expected output ofamultiinput noisy continuous function. Q2 is designed to need only a few experiments, it avoids stron...
Andrew W. Moore, Jeff G. Schneider, Justin A. Boya...
EVOW
2010
Springer
15 years 9 months ago
A New Selection Ratio for Large Population Sizes
Abstract. Motivated by parallel optimization, we study the SelfAdaptation algorithm for large population sizes. We first show that the current version of this algorithm does not r...
Fabien Teytaud
117
Voted
EVOW
2003
Springer
15 years 7 months ago
GAME-HDL: Implementation of Evolutionary Algorithms Using Hardware Description Languages
Evolutionary Algorithms (EAs) have been proposed as a very powerful heuristic optimization technique to solve complex problems. Many case studies have shown that they work very eff...
Rolf Drechsler, Nicole Drechsler