Sciweavers

1083 search results - page 103 / 217
» On the Number of Optimal Base 2 Representations of Integers
Sort
View
ISRR
2005
Springer
211views Robotics» more  ISRR 2005»
15 years 3 months ago
Field D*: An Interpolation-Based Path Planner and Replanner
Abstract. We present an interpolation-based planning and replanning algorithm for generating smooth paths through non-uniform cost grids. Most grid-based path planners use discrete...
Dave Ferguson, Anthony Stentz
ITCC
2005
IEEE
15 years 3 months ago
A Scalable Generative Topographic Mapping for Sparse Data Sequences
We propose a novel, computationally efficient generative topographic model for inferring low dimensional representations of high dimensional data sets, designed to exploit data s...
Ata Kabán
ICCCN
2007
IEEE
15 years 4 months ago
Large-Scale QoS-Aware Service-Oriented Networking with a Clustering-Based Approach
—Motivated by the fact that most of the existing QoS service composition solutions have limited scalability, we develop a hierarchical-based solution framework to achieve scalabi...
Jingwen Jin, Jin Liang, Jingyi Jin, Klara Nahrsted...
JSYML
2010
114views more  JSYML 2010»
14 years 8 months ago
The Ackermann functions are not optimal, but by how much?
By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of p...
Harold Simmons
WADS
2005
Springer
122views Algorithms» more  WADS 2005»
15 years 3 months ago
Hinged Dissection of Polypolyhedra
This paper presents a general family of 3D hinged dissections for polypolyhedra, i.e., connected 3D solids formed by joining several rigid copies of the same polyhedron along iden...
Erik D. Demaine, Martin L. Demaine, Jeffrey F. Lin...