Sciweavers

2343 search results - page 316 / 469
» The Locomotive Routing Problem
Sort
View
IV
2010
IEEE
196views Visualization» more  IV 2010»
15 years 4 months ago
3D Edge Bundling for Geographical Data Visualization
Visualization of graphs containing many nodes and edges efficiently is quite challenging since representations generally suffer from visual clutter induced by the large amount of...
Antoine Lambert, Romain Bourqui, David Auber
TPDS
2010
136views more  TPDS 2010»
15 years 4 months ago
Gossip-Based Self-Management of a Recursive Area Hierarchy for Large Wireless SensorNets
—A recursive multi-hop area hierarchy has a number of applications in wireless sensor networks, the most common being scalable point-to-point routing, so-called hierarchical rout...
Konrad Iwanicki, Maarten van Steen
ICCAD
2009
IEEE
92views Hardware» more  ICCAD 2009»
15 years 3 months ago
How to consider shorts and guarantee yield rate improvement for redundant wire insertion
This paper accurately considers wire short defects and proposes an algorithm to guarantee IC chip yield rate improvement for redundant wire insertion. Without considering yield ra...
Fong-Yuan Chang, Ren-Song Tsay, Wai-Kei Mak
ICCAD
2002
IEEE
227views Hardware» more  ICCAD 2002»
16 years 2 months ago
Generic ILP versus specialized 0-1 ILP: an update
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
16 years 18 days ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi