On time optimal solutions of the firing squad synchronization problem for two-dimensional paths.
Kojiro KobayashiPublished in: Theor. Comput. Sci. (2001)
Keyphrases
- firing squad synchronization
- optimal solution
- cellular automata
- internal states
- three dimensional
- cellular automaton
- np hard
- search space
- lower bound
- multi dimensional
- objective function
- shortest path
- knapsack problem
- input output
- branch and bound
- information retrieval
- feasible solution
- linear program
- branch and bound algorithm
- metaheuristic
- total cost
- path finding
- data sets
- pattern matching
- object oriented
- multiple paths
- special case