283 search results - page 8 / 57 » Strategies to Minimize Problems in Global Requirements Elici... |
JCB
2008
14 years 11 months ago
2008
Given a metabolic network in terms of its metabolites and reactions, our goal is to efficiently compute the minimal knock out sets of reactions required to block a given behaviour....
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
CP
2006
Springer
15 years 3 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
ATAL
2003
Springer
15 years 5 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...
148
click to vote
Publication
In this paper, we consider a decentralized supply chain formation problem for linear, multi-echelon supply chains when the managers of the individual echelons are autonomous, ratio...