841 search results - page 31 / 169 » Approximability of Minimum AND-Circuits |
EUSFLAT
2003
13 years 10 months ago
2003
A comparison is made of two approaches to approximate reasoning: Mamdani's interpolation method and the implication method. Both approaches are variants of Zadeh's compo...
ESA
2010
Springer
13 years 10 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
JCSS
2010
13 years 7 months ago
2010
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization ...
WAOA
2010
Springer
13 years 6 months ago
2010
Springer
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
CCCG
2008
13 years 10 months ago
2008
We consider the problem of embroidering a design pattern, given by a graph G, using a single minimum length thread. We give an exact polynomial-time algorithm for the case that G ...