Sciweavers

719 search results - page 118 / 144
» Solving Sparse Linear Constraints
Sort
View
SJ
2010
136views more  SJ 2010»
14 years 5 months ago
Optimizing the Migration to Future-Generation Passive Optical Networks (PON)
We study the upgrading problem of existing Passive Optical Networks (PONs) that need to increase their capacity at different points in time. Our method upgrades line rates and migr...
M. De Andrade, Massimo Tornatore, S. Sallent, Bisw...
ICML
2008
IEEE
15 years 12 months ago
On partial optimality in multi-label MRFs
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as...
Pushmeet Kohli, Alexander Shekhovtsov, Carsten Rot...
ASAP
2008
IEEE
199views Hardware» more  ASAP 2008»
15 years 1 months ago
An efficient method for evaluating polynomial and rational function approximations
In this paper we extend the domain of applicability of the E-method [7, 8], as a hardware-oriented method for evaluating elementary functions using polynomial and rational functio...
Nicolas Brisebarre, Sylvain Chevillard, Milos D. E...
EOR
2007
89views more  EOR 2007»
14 years 11 months ago
The service allocation problem at the Gioia Tauro Maritime Terminal
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
Jean-François Cordeau, Manlio Gaudioso, Gil...
TPDS
2008
175views more  TPDS 2008»
14 years 11 months ago
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
Olivier Beaumont, Larry Carter, Jeanne Ferrante, A...