Sciweavers

1578 search results - page 28 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
TCAD
2008
112views more  TCAD 2008»
13 years 7 months ago
A High-Performance Droplet Routing Algorithm for Digital Microfluidic Biochips
In this paper, we propose a high-performance droplet router for a digital microfluidic biochip (DMFB) design. Due to recent advancements in the biomicroelectromechanical system and...
Minsik Cho, David Z. Pan
COR
2008
111views more  COR 2008»
13 years 8 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
DAC
1998
ACM
14 years 26 days ago
Global Routing with Crosstalk Constraints
—Due to the scaling down of device geometry and increasing of frequency in deep submicron designs, crosstalk between interconnection wires has become an important issue in very l...
Hai Zhou, D. F. Wong
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
14 years 3 months ago
Maximum Flow in Directed Planar Graphs with Vertex Capacities
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
Haim Kaplan, Yahav Nussbaum
JSAC
2006
157views more  JSAC 2006»
13 years 8 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas