Sciweavers

2182 search results - page 183 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
INFOCOM
2002
IEEE
14 years 2 months ago
TCP Network Calculus: The case of large delay-bandwidth product
Abstract— We present in this paper an analytical model for the calculation of network load and drop probabilities in a TCP/IP network with general topology. First we formulate ou...
Eitan Altman, Konstantin Avrachenkov, Chadi Baraka...
COCOA
2007
Springer
14 years 3 months ago
On Threshold BDDs and the Optimal Variable Ordering Problem
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
Markus Behle
ISAAC
1992
Springer
132views Algorithms» more  ISAAC 1992»
14 years 1 months ago
Generalized Assignment Problems
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be ea...
Silvano Martello, Paolo Toth
BIOINFORMATICS
2010
116views more  BIOINFORMATICS 2010»
13 years 9 months ago
A principal skeleton algorithm for standardizing confocal images of fruit fly nervous systems
Motivation: The fruit fly (Drosophila melanogaster) is a commonly used model organism in biology. We are currently building a 3D digital atlas of the fruit fly larval nervous syst...
Lei Qu, Hanchuan Peng
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 3 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith