Sciweavers

360 search results - page 50 / 72
» The TV-Break Packing Problem
Sort
View
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
14 years 4 months ago
Optimizing yield in global routing
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
Dirk Müller
CEC
2007
IEEE
14 years 1 months ago
A histogram-matching approach to the evolution of bin-packing strategies
Abstract— We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the...
Riccardo Poli, John Woodward, Edmund K. Burke
INFOCOM
2007
IEEE
14 years 1 months ago
To Repair or Not To Repair: Helping Ad-hoc Routing Protocols to Distinguish Mobility from Congestion
Abstract—In this paper we consider the problem of distinguishing whether frame loss at the MAC layer has occurred due to mobility or congestion. Most ad hoc routing protocols mak...
Manoj Pandey, Roger Pack, Lei Wang, Qiuyi Duan, Da...
EEMMAS
2007
Springer
14 years 1 months ago
DECIDE: Applying Multi-agent Design and Decision Logic to a Baggage Handling System
Behind the curtains at check-in desks in airports hide some of the most complex material handling systems, which manage to get your bag transported to the correct departure gate of...
Kasper Hallenborg, Yves Demazeau
ICRA
2006
IEEE
217views Robotics» more  ICRA 2006»
14 years 1 months ago
Complete Coverage Control for Nonholonomic Mobile Robots in Dynamic Environments
— We study the problem of generating continuous steering control for robots to completely cover a bounded region over a finite time. First, we pack the area by disks of minimum ...
Yi Guo, Mohanakrishnan Balakrishnan