738 search results - page 28 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
84
Voted
WINE
2007
Springer
15 years 3 months ago
2007
Springer
In addition to useful Economic interpretation, auction based algorithms are generally found to be efficient. In this note, we observe that the auction-based mechanism can also be u...
WIMOB
2008
IEEE
15 years 4 months ago
2008
IEEE
—The Smart Party is a ubiquitous computing application based on the Panoply middleware. The Smart Party allows attendees at a party to transparently participate in the selection ...
111
click to vote
COCO
2009
Springer
15 years 4 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
INFORMATICALT
2000
14 years 9 months ago
2000
Abstract. Influence of projection pursuit on classification errors and estimates of a posteriori probabilities from the sample is considered. Observed random variable is supposed t...
SBBD
2004
14 years 11 months ago
2004
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...