Sciweavers

849 search results - page 20 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
IPPS
1996
IEEE
13 years 12 months ago
A Parallel Algorithm for Minimization of Finite Automata
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...
Bala Ravikumar, X. Xiong
SWAT
2004
Springer
120views Algorithms» more  SWAT 2004»
14 years 1 months ago
Railway Delay Management: Exploring Its Algorithmic Complexity
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
Michael Gatto, Björn Glaus, Riko Jacob, Leon ...
ICGA
1993
145views Optimization» more  ICGA 1993»
13 years 9 months ago
Genetic Programming of Minimal Neural Nets Using Occam's Razor
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...
Byoung-Tak Zhang, Heinz Mühlenbein
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
13 years 9 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...
CP
2007
Springer
13 years 11 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti