Sciweavers

3715 search results - page 327 / 743
» A Space Optimization for FP-Growth
Sort
View
167
Voted
TABLETOP
2006
IEEE
16 years 24 days ago
Considering Reach in Tangible and Table Top Design
Reach heavily impacts all aspects of designing for tangible and tabletop user interfaces. It dictates the input space available to each user and heavily shapes how that space is u...
Aaron Toney, Bruce H. Thomas
ICRA
2005
IEEE
91views Robotics» more  ICRA 2005»
16 years 12 days ago
Learning to Steer on Winding Tracks Using Semi-Parametric Control Policies
— We present a semi-parametric control policy representation and use it to solve a series of nonholonomic control problems with input state spaces of up to 7 dimensions. A neares...
Kenneth Robert Alton, Michiel van de Panne
EMO
2005
Springer
123views Optimization» more  EMO 2005»
16 years 10 days ago
Initial Population Construction for Convergence Improvement of MOEAs
Nearly all Multi-Objective Evolutionary Algorithms (MOEA) rely on random generation of initial population. In large and complex search spaces, this random method often leads to an ...
Christian Haubelt, Jürgen Gamenik, Jürge...
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
16 years 10 days ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
ISAAC
2005
Springer
118views Algorithms» more  ISAAC 2005»
16 years 9 days ago
External Data Structures for Shortest Path Queries on Planar Digraphs
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
Lars Arge, Laura Toma