176 search results - page 1 / 36 » Fast Periodic Correction Networks |
FCT
2003
Springer
13 years 10 months ago
2003
Springer
SIROCCO
2007
13 years 6 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
AUTOMATICA
2005
13 years 5 months ago
2005
For a lumped parameter model of a flow network driven by a periodic generator, we apply averaging to find an approximate solution and analyze its stability. The approximate soluti...
GISCIENCE
2010
Springer
13 years 5 months ago
2010
Springer
We designed and implemented a simple and fast heuristic for placing multiple labels along edges of a planar network. As a testbed, realworld data from Google Transit is taken: our ...
JACM
2000
13 years 5 months ago
2000
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...