1242 search results - page 37 / 249 » A Computational Complexity Theory in Membrane Computing |
INFORMATICALT
2010
13 years 5 months ago
2010
In the presented paper, some issues of the fundamental classical mechanics theory in the sense of Ising physics are introduced into the applied neural network area. The expansion o...
ECAI
1992
Springer
13 years 11 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
SAGT
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. In game theory, a player’s action is said to be weakly dominated if there exists another action that, with respect to what the other players do, is never worse and some...
GLVLSI
2009
IEEE
2009
IEEE
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
14 years 2 months ago
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
ISSAC
2004
Springer
14 years 23 days ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...