530 search results - page 7 / 106 » An Algorithm for Approximating the Satisfiability Problem of... |
ADCM
2005
13 years 7 months ago
2005
In this paper, we study a flexible piecewise approximation technique based on the use of the idea of the partition of unity. The approximations are piecewisely defined, globally sm...
COCOON
2009
Springer
14 years 2 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...
WINE
2010
Springer
13 years 5 months ago
2010
Springer
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
UAI
1994
13 years 9 months ago
1994
We show how to nd a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the rst step in the method of conditioning for inference....
AINA
2003
IEEE
13 years 11 months ago
2003
IEEE
Condition Data Flow Diagrams (CDFDs) are a formalized notation resulting from the integration of Yourdon Data Flow Diagrams, Petri Nets, and pre-post notation. They are used in th...