Sciweavers

7991 search results - page 1368 / 1599
» Using More Reasoning to Improve
Sort
View
JSAC
2006
199views more  JSAC 2006»
15 years 6 months ago
IDES: An Internet Distance Estimation Service for Large Networks
The responsiveness of networked applications is limited by communications delays, making network distance an important parameter in optimizing the choice of communications peers. S...
Yun Mao, Lawrence K. Saul, Jonathan M. Smith
JSC
2006
71views more  JSC 2006»
15 years 6 months ago
Towards a clausal analysis of cut-elimination
In this paper we show that a large class of cut-elimination methods can be analyzed by clause terms representing sets of characteristic clauses extractable from the original proof...
Matthias Baaz, Alexander Leitsch
171
Voted
NAR
2008
78views more  NAR 2008»
15 years 6 months ago
InParanoid 6: eukaryotic ortholog clusters with inparalogs
The InParanoid eukaryotic ortholog database (http://InParanoid.sbc.su.se/) has been updated to version 6 and is now based on 35 species. We collected all available `complete'...
Ann-Charlotte Berglund, Erik Sjölund, Gabriel...
NETWORK
2008
106views more  NETWORK 2008»
15 years 6 months ago
Toward internet-wide multipath routing
The Internet would be more efficient and robust if routers could flexibly divide traffic over multiple paths. Often, having one or two extra paths is sufficient for customizing pa...
Jiayue He, Jennifer Rexford
MP
2006
110views more  MP 2006»
15 years 6 months ago
Decomposition and Dynamic Cut Generation in Integer Linear Programming
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
Ted K. Ralphs, Matthew V. Galati
« Prev « First page 1368 / 1599 Last » Next »