2496 search results - page 176 / 500 » On covering by translates of a set |
188
click to vote
STACS
1991
Springer
15 years 10 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
165
click to vote
AAAI
2010
15 years 8 months ago
2010
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
169
click to vote
DLT
2009
15 years 4 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
144
click to vote
ICFEM
2009
Springer
15 years 4 months ago
2009
Springer
We present the integration of refinement method of VSE verification tool, successfully used in industrial applications, in the Heterogeneous Tool Set HETS. The connection is done v...
189
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...