1272 search results - page 218 / 255 » The Set Cover with Pairs Problem |
COMPGEOM
1998
ACM
14 years 2 months ago
1998
ACM
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...
ESA
1994
Springer
14 years 2 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
KR
2000
Springer
14 years 1 months ago
2000
Springer
We investigate the problem of reasoning with partitions of related logical axioms. Our motivation is two-fold. First, we are concerned with how to reason effectively with multiple...
TACAS
2000
Springer
14 years 1 months ago
2000
Springer
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
ANNPR
2008
Springer
14 years 3 days ago
2008
Springer
Most of what we know about multiple classifier systems is based on empirical findings, rather than theoretical results. Although there exist some theoretical results for simple and...