Sciweavers

2254 search results - page 41 / 451
» Computing the minimal covering set
Sort
View
BMVC
2001
14 years 10 days ago
Robust Registration of 2D and 3D Point Sets
This paper introduces a new method of registering point sets. The registration error is directly minimized using general-purpose non-linear optimization (the Levenberg–Marquardt...
Andrew W. Fitzgibbon
ICCAD
2001
IEEE
192views Hardware» more  ICCAD 2001»
14 years 6 months ago
BOOM - A Heuristic Boolean Minimizer
We present a two-level Boolean minimization tool (BOOM) based on a new implicant generation paradigm. In contrast to all previous minimization methods, where the implicants are ge...
Jan Hlavicka, Petr Fiser
FLAIRS
1998
13 years 11 months ago
Generating Diagnoses from Conflict Sets
Many techniques of finding possible diagnoses of faulty technical systems involve two sequential steps. First compute the collection of all minimal conflict sets, then transform t...
Rolf Haenni
JAIR
2010
153views more  JAIR 2010»
13 years 8 months ago
Algorithms for Closed Under Rational Behavior (CURB) Sets
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-pl...
Michael Benisch, George B. Davis, Tuomas Sandholm
CSJM
2006
79views more  CSJM 2006»
13 years 10 months ago
Generating Languages by P Systems with Minimal Symport/Antiport
It is known that P systems with two membranes and minimal symport/antiport rules are "almost" computationally complete as generators of number or vector sets. Interpreti...
Artiom Alhazov, Yurii Rogozhin