Sciweavers

4949 search results - page 111 / 990
» Consistency and Set Intersection
Sort
View
DM
2002
134views more  DM 2002»
15 years 4 months ago
Covering a hypergraph of subgraphs
Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...
Noga Alon
ANSOFT
1999
85views more  ANSOFT 1999»
15 years 4 months ago
Modeling Concurrent Real-Time Processes Using Discrete Events
We give a formal framework for studying real-time discrete-event systems. It describes concurrent processes as sets of possible behaviors. Compositions of processes are processes ...
Edward A. Lee
IPL
2002
65views more  IPL 2002»
15 years 4 months ago
A new bound for map labeling with uniform circle pairs
Given a planar point set, we wish to label the points with uniform circular labels such that each input point lies on the boundary of two labels, none of the interiors of the labe...
Michael J. Spriggs, J. Mark Keil
SIAMJO
2002
102views more  SIAMJO 2002»
15 years 4 months ago
Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
We consider a conic-quadratic (and in particular a quadratically constrained) optimization problem with uncertain data, known only to reside in some uncertainty set U. The robust ...
Aharon Ben-Tal, Arkadi Nemirovski, Cees Roos
COCOON
2009
Springer
15 years 11 months ago
On Finding Small 2-Generating Sets
Given a set of positive integers S, we consider the problem of finding a minimum cardinality set of positive integers X (called a minimum 2-generating set of S) s.t. every element...
Isabelle Fagnot, Guillaume Fertin, Stéphane...