Sciweavers

719 search results - page 135 / 144
» Solving Sparse Linear Constraints
Sort
View
80
Voted
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 1 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
ASPDAC
2005
ACM
119views Hardware» more  ASPDAC 2005»
15 years 5 days ago
CMP aware shuttle mask floorplanning
- By putting different chips on the same mask, shuttle mask (or multiple project wafer) provides an economical solution for low volume designs and design prototypes to share the ri...
Gang Xu, Ruiqi Tian, David Z. Pan, Martin D. F. Wo...
73
Voted
SDM
2010
SIAM
165views Data Mining» more  SDM 2010»
14 years 11 months ago
Exact Passive-Aggressive Algorithm for Multiclass Classification Using Support Class
The Passive Aggressive framework [1] is a principled approach to online linear classification that advocates minimal weight updates i.e., the least required so that the current tr...
Shin Matsushima, Nobuyuki Shimizu, Kazuhiro Yoshid...
COR
2007
133views more  COR 2007»
14 years 10 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
85
Voted
ENTCS
2007
141views more  ENTCS 2007»
14 years 10 months ago
Compressing BMC Encodings with QBF
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
Toni Jussila, Armin Biere