8647 search results - page 411 / 1730 » The Container Selection Problem |
121
click to vote
EJC
2010
15 years 4 months ago
2010
The paper contains a construction of a universal countable graph, different from the Rado graph, such that for any of its vertices both the neighbourhood and the non-neighbourhood ...
134
click to vote
JSAT
2007
15 years 4 months ago
2007
We consider the satisfiability problem for Boolean combinations of unit two variable per inequality (UTVPI) constraints. A UTVPI constraint is linear constraint containing at mos...
123
click to vote
SOFTWARE
2002
15 years 4 months ago
2002
We present a new approach to test selection in sequential diagnosis (or classification) in the independence Bayesian framework that resembles the hypothetico-deductive approach to ...
160
click to vote
MP
2007
15 years 4 months ago
2007
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branc...
174
click to vote
PODS
1992
ACM
15 years 9 months ago
1992
ACM
: We study the problem of determining whether a given recursive Datalog program is equivalent to a given nonrecursive Datalog program. Since nonrecursive Datalog programs are equiv...