1208 search results - page 61 / 242 » Uniform eventown problems |
IJCAI
2007
14 years 11 months ago
2007
We introduce a new technique for counting models of Boolean satisfiability problems. Our approach incorporates information obtained from sampling the solution space. Unlike previ...
APVIS
2006
14 years 11 months ago
2006
We study a variation of the boundary labelling problem, with floating sites (represented as polygons), labels of uniform size placed in fixed positions on the boundary of a rectan...
NIPS
2001
14 years 11 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
DAM
2006
14 years 10 months ago
2006
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
AUTOMATICA
2002
14 years 10 months ago
2002
This paper addresses the initial shift problem in iterative learning control with system relative degree. The tracking error caused by nonzero initial shift is detected when apply...