Sciweavers

1576 search results - page 216 / 316
» Properties of Synthetic Optimization Problems
Sort
View
ALMOB
2006
113views more  ALMOB 2006»
13 years 10 months ago
Inverse bifurcation analysis: application to simple gene systems
Background: Bifurcation analysis has proven to be a powerful method for understanding the qualitative behavior of gene regulatory networks. In addition to the more traditional for...
James Lu, Heinz W. Engl, Peter Schuster
NIPS
2007
13 years 11 months ago
The discriminant center-surround hypothesis for bottom-up saliency
The classical hypothesis, that bottom-up saliency is a center-surround process, is combined with a more recent hypothesis that all saliency decisions are optimal in a decision-the...
Dashan Gao, Vijay Mahadevan, Nuno Vasconcelos
IOR
2007
89views more  IOR 2007»
13 years 10 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...
EOR
2010
110views more  EOR 2010»
13 years 10 months ago
Pricing surplus server capacity for mean waiting time sensitive customers
Resources including various assets of supply chains, face random demand over time and can be shared by others. We consider an operational setting where a resource is shared by two...
Sudhir K. Sinha, N. Rangaraj, N. Hemachandra
SIAMJO
2010
130views more  SIAMJO 2010»
13 years 4 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...