Sciweavers

2157 search results - page 74 / 432
» Optimal Fast Hashing
Sort
View
IROS
2009
IEEE
125views Robotics» more  IROS 2009»
15 years 11 months ago
Planning and fast re-planning of safe motions for humanoid robots: Application to a kicking motion
Abstract— Optimal motions are usually used as joint reference trajectories for repetitive or complex motions. In the case of soccer robots, the kicking motion is usually a benchm...
Sebastien Lengagne, Philippe Fraisse, Nacim Ramdan...
MMAS
2010
Springer
14 years 11 months ago
A Fast Multigrid Algorithm for Energy Minimization under Planar Density Constraints
The two-dimensional layout optimization problem reinforced by the efficient space utilization demand has a wide spectrum of practical applications. Formulating the problem as a non...
Dorit Ron, Ilya Safro, Achi Brandt
185
Voted
BTW
2003
Springer
170views Database» more  BTW 2003»
15 years 10 months ago
Executing Nested Queries
Abstract: Optimization of nested queries, in particular finding equivalent “flattened” queries for queries that employ the SQL sub-query construct, has been researched extensiv...
Goetz Graefe
PPOPP
2011
ACM
14 years 7 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
ICCAD
2008
IEEE
150views Hardware» more  ICCAD 2008»
16 years 1 months ago
Performance estimation and slack matching for pipelined asynchronous architectures with choice
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
Gennette Gill, Vishal Gupta, Montek Singh