Sciweavers

414 search results - page 66 / 83
» Integer Linear Programming Models for Global Routing
Sort
View
CP
2005
Springer
14 years 1 months ago
Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
ICCAD
2005
IEEE
118views Hardware» more  ICCAD 2005»
14 years 4 months ago
Thermal via planning for 3-D ICs
Heat dissipation is one of the most serious challenges in 3D IC designs. One effective way of reducing circuit temperature is to introduce thermal through-the-silicon (TTS) vias....
Jason Cong, Yan Zhang
UAI
1997
13 years 8 months ago
Robustness Analysis of Bayesian Networks with Local Convex Sets of Distributions
Robust Bayesian inference is the calculation of posterior probability bounds given perturbations in a probabilistic model. This paper focuses on perturbations that can be expresse...
Fabio Gagliardi Cozman
MICCAI
2010
Springer
13 years 6 months ago
Nonlinear Embedding towards Articulated Spine Shape Inference Using Higher-Order MRFs
In this paper we introduce a novel approach for inferring articulated spine models from images. A low-dimensional manifold embedding is created from a training set of prior mesh mo...
Samuel Kadoury, Nikos Paragios
INFOCOM
2009
IEEE
14 years 2 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao