Sciweavers

2681 search results - page 35 / 537
» Problem F
Sort
View
MOR
2007
138views more  MOR 2007»
13 years 8 months ago
The Demand-Matching Problem
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...
F. Bruce Shepherd, Adrian Vetta
SIAMJO
2008
86views more  SIAMJO 2008»
13 years 8 months ago
On the Second-Order Feasibility Cone: Primal-Dual Representation and Efficient Projection
We study the second-order feasibility cone F = {y IRn : My gT y} for given data (M, g). We construct a new representation for this cone and its dual based on the spectral decompo...
Alexandre Belloni, Robert M. Freund
ENDM
2007
70views more  ENDM 2007»
13 years 8 months ago
Hamiltonian fault-tolerance of hypercubes
Given a set F of faulty edges or faulty vertices in the hypercube Qn and a pair of vertices u, v, is there a hamiltonian cycle or a hamiltonian path between u and v in Qn −F? We...
Tomás Dvorák, Petr Gregor
SAC
2000
ACM
14 years 13 days ago
An Approach for Modeling the Name Lookup Problem in the C++ Programming Language
Abstract. Formal grammars are well established for specifying the syntax of programming languages. However, the formal specification of programming language semantics has proven mo...
James F. Power, Brian A. Malloy
WDAG
1997
Springer
106views Algorithms» more  WDAG 1997»
14 years 1 months ago
Performing Tasks on Restartable Message-Passing Processors
Abstract. This work presents new algorithms for the "Do-All" problem that consists of performing t tasks reliably in a message-passing synchronous system of p fault-prone...
Bogdan S. Chlebus, Roberto De Prisco, Alexander A....