Sciweavers

5510 search results - page 278 / 1102
» Mathematics
Sort
View
DISOPT
2008
107views more  DISOPT 2008»
15 years 6 months ago
The k-path tree matroid and its applications to survivable network design
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
Esther M. Arkin, Refael Hassin
FAC
2008
92views more  FAC 2008»
15 years 6 months ago
Capture-avoiding substitution as a nominal algebra
Substitution is fundamental to the theory of logic and computation. Is substitution something that we define on syntax on a case-by-case basis, or can we turn the idea of substitut...
Murdoch James Gabbay, Aad Mathijssen
CSJM
2006
81views more  CSJM 2006»
15 years 6 months ago
Nash equilibria set computing in finite extended games
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Valeriu Ungureanu
DM
2006
63views more  DM 2006»
15 years 6 months ago
Efficient crossover designs for comparing test treatments with a control treatment
Within a large family of crossover designs this paper characterizes the mathematical structures of A-optimal and A-efficient crossover designs for the purpose of statistical compa...
A. Sadam Hedayat, Min Yang
ENTCS
2006
113views more  ENTCS 2006»
15 years 6 months ago
A Large-Scale Experiment in Executing Extracted Programs
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
Luís Cruz-Filipe, Pierre Letouzey