Sciweavers

4539 search results - page 215 / 908
» Approaches to Compute Workflow Complexity
Sort
View
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
15 years 10 months ago
Fast C-obstacle Query Computation for Motion Planning
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
Liangjun Zhang, Young J. Kim, Gokul Varadhan, Dine...
OOPSLA
2005
Springer
15 years 10 months ago
DOSC: dispersed operating system computing
Over the past decade the sheer size and complexity of traditional operating systems have prompted a wave of new approaches to help alleviate the services provided by these operati...
Ramesh K. Karne, Karthick V. Jaganathan, Nelson Ro...
FOCS
2000
IEEE
15 years 9 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk
DAC
2005
ACM
16 years 5 months ago
Locality-conscious workload assignment for array-based computations in MPSOC architectures
While the past research discussed several advantages of multiprocessor-system-on-a-chip (MPSOC) architectures from both area utilization and design verification perspectives over ...
Feihui Li, Mahmut T. Kandemir
CEC
2007
IEEE
15 years 11 months ago
Computational chemotaxis in ants and bacteria over dynamic environments
— Chemotaxis can be defined as an innate behavioural response by an organism to a directional stimulus, in which bacteria, and other single-cell or multicellular organisms direct...
Vitorino Ramos, Carlos Fernandes, Agostinho C. Ros...