Sciweavers

4266 search results - page 171 / 854
» The container loading problem
Sort
View
117
Voted
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 4 months ago
Approximation Algorithms for Dominating Set in Disk Graphs
We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been extensively studied on subclasses of disk graphs, ye...
Matt Gibson, Imran A. Pirwani
EJC
2010
15 years 4 months ago
On graphs isomorphic to their neighbour and non-neighbour sets
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 ...
Przemyslaw Gordinowicz
126
Voted
JSAT
2007
47views more  JSAT 2007»
15 years 3 months ago
On Solving Boolean Combinations of UTVPI Constraints
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...
Sanjit A. Seshia, K. Subramani, Randal E. Bryant
161
Voted
PODS
1992
ACM
100views Database» more  PODS 1992»
15 years 8 months ago
On the Equivalence of Recursive and Nonrecursive Datalog Programs
: 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...
Surajit Chaudhuri, Moshe Y. Vardi
FLAIRS
2003
15 years 5 months ago
Proving Harder Theorems by Axiom Reduction
Automated Theorem Proving (ATP) problems may contain unnecessary axioms, either because some of the axiomatization of the theory is irrelevant to the particular theorem, or becaus...
Geoff Sutcliffe, Alexander Dvorský