2107 search results - page 65 / 422 » b 2007 |
AML
2007
14 years 12 months ago
2007
A method is described for obtaining conjunctive normal forms for logics using Gentzen-style rules possessing a special kind of strong invertibility. This method is then applied to ...
AAAI
2007
15 years 2 months ago
2007
We present a CNF to Tree-of-BDDs (ToB) compiler with complexity at most exponential in the tree width. We then present algorithms for interesting queries on ToB. Although some of ...
CCCG
2006
15 years 1 months ago
2006
Given two sets A and B of n points each in R2 , we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. W...
ALGORITHMICA
2002
14 years 11 months ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
106
click to vote
DCC
2007
IEEE
15 years 11 months ago
2007
IEEE
Many different divisible designs are already known. Some of them possess remarkable automorphism groups, so called dual translation groups. The existence of such an automorphism g...