Sciweavers

469 search results - page 59 / 94
» A Branch-and-Prune Algorithm for Solving Systems of Distance...
Sort
View
COMPGEOM
2008
ACM
13 years 9 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
AIPS
1994
13 years 9 months ago
A Framework for Automatic Problem Decomposition in Planning
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
Qiang Yang, Shuo Bai, Guiyou Qiu
WSCG
2003
165views more  WSCG 2003»
13 years 9 months ago
Interactive Animation of Cloth Including Self Collision Detection
We describe a system for interactive animation of cloth, which can be used in e-commerce applications, games or even in virtual prototyping systems. In order not to restrict the s...
Arnulph Fuhrmann, Clemens Groß, Volker Lucka...
PODS
2008
ACM
128views Database» more  PODS 2008»
14 years 8 months ago
Shape sensitive geometric monitoring
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
Izchak Sharfman, Assaf Schuster, Daniel Keren
DAC
2004
ACM
14 years 9 months ago
Memory access scheduling and binding considering energy minimization in multi-bank memory systems
Memory-related activity is one of the major sources of energy consumption in embedded systems. Many types of memories used in embedded systems allow multiple operating modes (e.g....
Chun-Gi Lyuh, Taewhan Kim