Sciweavers

5510 search results - page 1102 / 1102
» Mathematics
Sort
View
ECCC
2007
147views more  ECCC 2007»
13 years 4 months ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...
MLQ
2000
99views more  MLQ 2000»
13 years 4 months ago
Von Rimscha's Transitivity Conditions
In Zermelo-Fraenkel set theory with the axiom of choice every set has the same cardinal number as some ordinal. Von Rimscha has weakened this condition to "Every set has the s...
Paul E. Howard, Jean E. Rubin, Adrienne Stanley
ADCM
1998
132views more  ADCM 1998»
13 years 4 months ago
Numerical solution of generalized Lyapunov equations
Two e cient methods for solving generalized Lyapunov equations and their implementations in FORTRAN 77 are presented. The rst one is a generalization of the Bartels{Stewart method...
Thilo Penzl
SIAMMA
2011
97views more  SIAMMA 2011»
12 years 7 months ago
Convergence Rates for Greedy Algorithms in Reduced Basis Methods
The reduced basis method was introduced for the accurate online evaluation of solutions to a parameter dependent family of elliptic partial differential equations. ly, it can be ...
Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald...
PODC
2012
ACM
11 years 7 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...
« Prev « First page 1102 / 1102 Last » Next »