Sciweavers

570 search results - page 79 / 114
» A Connectivity Constraint Using Bridges
Sort
View
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 7 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
BMCBI
2005
94views more  BMCBI 2005»
13 years 9 months ago
YANA - a software tool for analyzing flux modes, gene-expression and enzyme activities
Background: A number of algorithms for steady state analysis of metabolic networks have been developed over the years. Of these, Elementary Mode Analysis (EMA) has proven especial...
Roland Schwarz, Patrick Musch, Axel von Kamp, Bern...
GECCO
2003
Springer
162views Optimization» more  GECCO 2003»
14 years 3 months ago
Optimization of Spare Capacity in Survivable WDM Networks
A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for ...
H. W. Chong, Sam Kwong
CN
2006
70views more  CN 2006»
13 years 10 months ago
Preventing persistent oscillations and loops in IBGP configuration with route reflection
Abstract-- Internal Border Gateway Protocol (IBGP) is responsible for distributing external reachability information, obtained via External-BGP (EBGP) sessions, within an autonomou...
Anuj Rawat, Mark A. Shayman
WWW
2007
ACM
14 years 10 months ago
Compiling cryptographic protocols for deployment on the web
Cryptographic protocols are useful for trust engineering in Web transactions. The Cryptographic Protocol Programming Language (CPPL) provides a model wherein trust management anno...
Jay A. McCarthy, Shriram Krishnamurthi, Joshua D. ...