738 search results - page 21 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
84
Voted
WINE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We provide the first strongly polynomial time exact combinatorial algorithm to compute Fisher equilibrium for the case when utility functions do not satisfy the Gross su...
100
click to vote
KR
2004
Springer
15 years 3 months ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Given any two images taken under different illumination conditions, there always exist a physically realizable object which is consistent with both the images even if the lighting...
CLA
2006
14 years 11 months ago
2006
We present graded extension of the algorithm LinClosure. Graded LinClosure can be used to compute degrees of semantic entailment from sets of fuzzy attribute implications. It can a...