Sciweavers

10608 search results - page 2061 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ECP
1997
Springer
128views Robotics» more  ECP 1997»
14 years 1 months ago
SINERGY: A Linear Planner Based on Genetic Programming
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
Ion Muslea
ICPADS
1994
IEEE
14 years 28 days ago
Stochastic Modeling of Scaled Parallel Programs
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...
ICS
2010
Tsinghua U.
14 years 28 days ago
Weight Distribution and List-Decoding Size of Reed-Muller Codes
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
Tali Kaufman, Shachar Lovett, Ely Porat
SIGMOD
1993
ACM
150views Database» more  SIGMOD 1993»
14 years 27 days ago
Predicate Migration: Optimizing Queries with Expensive Predicates
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
Joseph M. Hellerstein, Michael Stonebraker
POPL
1989
ACM
14 years 26 days ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
« Prev « First page 2061 / 2122 Last » Next »