Sciweavers

4797 search results - page 27 / 960
» The complexity of partition tasks
Sort
View
GLOBECOM
2008
IEEE
13 years 9 months ago
A Framework for Dual-Agent MANET Routing Protocols
— Nodes forming mobile ad hoc networks (MANET) nodes can be logically partitioned into 1) a selfish user agent serving the interests of the end user (owner) of the mobile device...
Brian L. Gaines, Mahalingam Ramkumar
DATE
2004
IEEE
159views Hardware» more  DATE 2004»
14 years 16 days ago
Compositional Memory Systems for Data Intensive Applications
To alleviate the system performance unpredictability of multitasking applications running on multiprocessor platforms with shared memory hierarchies we propose a task level set ba...
Anca Mariana Molnos, Marc J. M. Heijligers, Sorin ...
ISPD
1999
ACM
126views Hardware» more  ISPD 1999»
14 years 1 months ago
Partitioning by iterative deletion
Netlist partitioning is an important and well studied problem. In this paper, a linear time partitioning approach based on iterative deletion is presented. We use the partitioning...
Patrick H. Madden
TSMC
2010
13 years 3 months ago
Interactive Teaching for Vision-Based Mobile Robots: A Sensory-Motor Approach
Abstract--For the last decade, we have developed a visionbased architecture for mobile robot navigation. Our bio-inspired model of the navigation has proved to achieve sensory-moto...
Christophe Giovannangeli, Philippe Gaussier
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
13 years 10 months ago
Binary space partitions for 3D subdivisions
We consider the following question: Given a subdivision of space into n convex polyhedral cells, what is the worst-case complexity of a binary space partition (BSP) for the subdiv...
John Hershberger, Subhash Suri