Sciweavers

334 search results - page 51 / 67
» Dynamic Three-Dimensional Linear Programming
Sort
View
ICALP
2010
Springer
15 years 2 months ago
New Data Structures for Subgraph Connectivity
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
Ran Duan
72
Voted
COR
2007
133views more  COR 2007»
14 years 9 months ago
Reverse logistics network design with stochastic lead times
This work is concerned with the efficient design of a reverse logistics network using an extended version of models currently found in the literature. Those traditional, basic mo...
Kris Lieckens, Nico Vandaele
CORR
2008
Springer
172views Education» more  CORR 2008»
14 years 9 months ago
Altruism in Congestion Games
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. ...
Martin Hoefer, Alexander Skopalik
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
15 years 10 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
ISPD
2012
ACM
283views Hardware» more  ISPD 2012»
13 years 5 months ago
Low-power gated bus synthesis for 3d ic via rectilinear shortest-path steiner graph
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
Chung-Kuan Cheng, Peng Du, Andrew B. Kahng, Shih-H...