1964 search results - page 239 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
ICGI
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
We present a novel variant of the RANSAC algorithm
that is much more efficient, in particular when dealing with
problems with low inlier ratios. Our algorithm assumes
that there...
BMCBI
2008
13 years 8 months ago
2008
Background: The prediction of conformational B-cell epitopes is one of the most important goals in immunoinformatics. The solution to this problem, even if approximate, would help...
ISCA
2005
IEEE
14 years 1 months ago
2005
IEEE
: The theoretical study of quantum computation has yielded efficient algorithms for some traditionally hard problems. Correspondingly, experimental work on the underlying physical...
TON
2010
13 years 3 months ago
2010
Abstract--A framework for designing feedback-based scheduling algorithms is proposed for elegantly solving the notorious packet missequencing problem of a load-balanced switch. Unl...