Sciweavers

599 search results - page 94 / 120
» The traveling salesman problem
Sort
View
EDBT
2008
ACM
150views Database» more  EDBT 2008»
14 years 8 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
IROS
2009
IEEE
137views Robotics» more  IROS 2009»
14 years 2 months ago
A framework for planning comfortable and customizable motion of an assistive mobile robot
Abstract— Assistive mobile robots that can navigate autonomously can greatly benefit people with mobility impairments. Since an assistive mobile robot transports a human user fr...
Shilpa Gulati, Chetan Jhurani, Benjamin Kuipers, R...
MEMOCODE
2006
IEEE
14 years 1 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
ATMOS
2010
183views Optimization» more  ATMOS 2010»
13 years 6 months ago
The Complexity of Integrating Routing Decisions in Public Transportation Models
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
Marie Schmidt, Anita Schöbel
ICCD
2006
IEEE
95views Hardware» more  ICCD 2006»
14 years 4 months ago
Scale in Chip Interconnect requires Network Technology
— Continued scaling of CMOS has lead to a problem of scale as gates are faster than light travelling across a chip. Scalability used to be the hallmark of CMOS. Half the size, do...
Enno Wein