Sciweavers

Share
JSAC
2006
88views more  JSAC 2006»
8 years 4 months ago
OSNR optimization in optical networks: modeling and distributed algorithms via a central cost approach
Abstract-- This paper addresses the problem of optical signalto-noise ratio (OSNR) optimization in optical networks. An analytical OSNR network model is developed for a general mul...
L. Pavel
MANSCI
2008
75views more  MANSCI 2008»
8 years 4 months ago
Staffing Multiskill Call Centers via Linear Programming and Simulation
We study an iterative cutting-plane algorithm on an integer program, for minimizing the staffing costs of a multiskill call center subject to service-level requirements which are e...
Mehmet Tolga Çezik, Pierre L'Ecuyer
EOR
2006
59views more  EOR 2006»
8 years 4 months ago
Sensitivity analysis in linear optimization: Invariant support set intervals
Sensitivity analysis is one of the most interesting and preoccupying areas in optimization. Many attempts are made to investigate the problem's behavior when the input data c...
Alireza Ghaffari Hadigheh, Tamás Terlaky
EOR
2008
162views more  EOR 2008»
8 years 4 months ago
Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
Given arbitrary source and target nodes s, t and an s
Benedicte Vatinlen, Fabrice Chauvet, Philippe Chr&...
CORR
2010
Springer
62views Education» more  CORR 2010»
8 years 4 months ago
Twenty Questions Games Always End With Yes
Huffman coding is often presented as the optimal solution to Twenty Questions. However, a caveat is that Twenty Questions games always end with a reply of "Yes," whereas ...
John T. Gill III, William Wu
DAGSTUHL
1994
8 years 5 months ago
Competitive Strategies for Autonomous Systems
A strategy for working with incomplete information is called competitive if it solves each problem instance at a cost not exceeding the cost of an optimal solution (with full info...
Christian Icking, Rolf Klein
AIPS
1994
8 years 5 months ago
A Planner with Quality Goal and Its Speed-up Learning for Optimization Problem
Aimsof traditional planners had beenlimited to finding a sequenceof operators rather than finding an optimal or neax-optimalfinal state. Consequent]y, the performanceimprovementsy...
Masahiko Iwamoto
APDC
1997
8 years 5 months ago
A Parallel Algorithm for Optimal Task Assignment in Distributed Systems
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...
Ishfaq Ahmad, Muhammad Kafil
NIPS
2003
8 years 5 months ago
Geometric Clustering Using the Information Bottleneck Method
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...
Susanne Still, William Bialek, Léon Bottou
IPCO
2001
125views Optimization» more  IPCO 2001»
8 years 5 months ago
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs
Abstract. We consider the general nonlinear optimization problem in 01 variables and provide an explicit equivalent convex positive semidefinite program in 2n - 1 variables. The op...
Jean B. Lasserre
books