Sciweavers

240 search results - page 18 / 48
» The Tree Inclusion Problem: In Optimal Space and Faster
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
Bootstrapping Free-Space Optical Networks
Title of thesis: BOOTSTRAPPING FREE-SPACE OPTICAL NETWORKS Fang Liu, Master of Science, 2004 Thesis directed by: Professor Uzi Vishkin Department of Electrical and Computer Engine...
Fang Liu, Uzi Vishkin, Stuart Milner
ICRA
2009
IEEE
106views Robotics» more  ICRA 2009»
14 years 2 months ago
Inverse kinematics with closed form solutions for highly redundant robotic systems
— This paper presents inverse position kinematics algorithms with real time capability for Justin, a robotic system with high redundancy and many degrees of freedom. The combinat...
Rainer Konietschke, Gerd Hirzinger
ICTAI
2003
IEEE
14 years 1 months ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière
ISCAS
2003
IEEE
128views Hardware» more  ISCAS 2003»
14 years 1 months ago
Placement with symmetry constraints for analog layout using red-black trees
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
Sarat C. Maruvada, Karthik Krishnamoorthy, Subodh ...
MEMETIC
2010
311views more  MEMETIC 2010»
13 years 2 months ago
Iterated local search with Powell's method: a memetic algorithm for continuous global optimization
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
Oliver Kramer