Sciweavers

1220 search results - page 70 / 244
» Restricting grammatical complexity
Sort
View
ANTSW
2010
Springer
13 years 5 months ago
Coordinating Heterogeneous Swarms through Minimal Communication among Homogeneous Sub-swarms
robotics, the agents are often assumed to be identical. In this abstract, we argue that the cooperation between swarms of different kinds of robots can enhance the capabilities of ...
Carlo Pinciroli, Rehan O'Grady, Anders Lyhne Chris...
TOG
2012
188views Communications» more  TOG 2012»
11 years 10 months ago
Deformable objects alive!
We present a method for controlling the motions of active deformable characters. As an underlying principle, we require that all motions be driven by internal deformations. We ach...
Stelian Coros, Sebastian Martin, Bernhard Thomasze...
ACSC
2007
IEEE
14 years 2 months ago
Mutually Visible Agents in a Discrete Environment
As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much wor...
Joel Fenwick, Vladimir Estivill-Castro
ICALP
2007
Springer
14 years 1 months ago
Aliased Register Allocation for Straight-Line Programs Is NP-Complete
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
Jonathan K. Lee, Jens Palsberg, Fernando Magno Qui...
SAC
2005
ACM
14 years 1 months ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq