Results 261 to 270 of about 925,039 (306)
Estimated suitability distribution for Culicoides (Haematomyidium) paraensis (Diptera: Ceratopogonidae) in the contiguous United States and associated Caribbean territories. [PDF]
J Med EntomolHolcomb KM, Dunford JC, Connelly CR.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Operations Research, 1972
This paper establishes some useful properties of the equality-constrained set-covering problem P and the associated linear program P′. First, the Dantzig property of transportation matrices is shown to hold for a more general class of matrices arising in connection with adjacent integer solutions to P′.
Egon Balas, Manfred W. Padberg
openaire +2 more sources
This paper establishes some useful properties of the equality-constrained set-covering problem P and the associated linear program P′. First, the Dantzig property of transportation matrices is shown to hold for a more general class of matrices arising in connection with adjacent integer solutions to P′.
Egon Balas, Manfred W. Padberg
openaire +2 more sources
Canadian Journal of Mathematics, 1980
The proof of a main result in [1] concerning (0,1)-endomorphisms of finite lattices is based on properties of lattices A(G) derived from the system of independent sets of an undirected loop-free graph G. For a number of questions naturally arising from [1] and [2], however, constructions employing only graph-induced complementation and properties of ...
Adams, M. E., Sichler, J.
openaire +2 more sources
The proof of a main result in [1] concerning (0,1)-endomorphisms of finite lattices is based on properties of lattices A(G) derived from the system of independent sets of an undirected loop-free graph G. For a number of questions naturally arising from [1] and [2], however, constructions employing only graph-induced complementation and properties of ...
Adams, M. E., Sichler, J.
openaire +2 more sources
The set covering machine [PDF]
J. Mach. Learn. Res., 2002 Summary: We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the data and to allow a trade-off between accuracy and complexity. The result is a general-purpose learning machine, suitable for practical learning tasks, that we call ...
Marchand, Mario, Shawe-Taylor, J.
openaire +2 more sources
The Probabilistic Set-Covering Problem
Operations Research, 2002In a probabilistic set-covering problem the right-hand side is a random binary vector and the covering constraint has to be satisfied with some prescribed probability. We analyze the structure of the set of probabilistically efficient points of binary random vectors, develop methods for their enumeration, and propose specialized branch-and-bound ...
BERALDI, Patrizia, RUSZCZYNSKI A.
openaire +3 more sources