406 search results - page 58 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
102
click to vote
CP
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
IPPS
1996
IEEE
15 years 3 months ago
1996
IEEE
In this paper, we present a parallel algorithm for the minimization of deterministic finite state automata (DFA's) and discuss its implementation on a connection machine CM-5...
AAAI
2000
15 years 1 months ago
2000
Certain problems in connection with, for example, cooperating agents and distributed systems require reasoning about time which is measured on incomparable or unsynchronized time ...
114
click to vote
ICGA
1993
15 years 1 months ago
1993
A genetic programming method is investigated for optimizing both the architecture and the connection weights of multilayer feedforward neural networks. The genotype of each networ...