We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
Abstract— The convergence of the wireline telecom, wireless telecom, and internet networks and the services they provide offers tremendous opportunities in services personalizati...
Robert Dinoff, Tin Kam Ho, Richard Hull, Bharat Ku...
A fundamental difficulty faced by groups of agents that work together is how to efficiently coordinate their efforts. This coordination problem is both ubiquitous and challenging,...
The Informedia Digital Video Library system extracts information from digitized video sources and allows full content search and retrieval over all extracted data. This extracted ...
Howard D. Wactlar, Alexander G. Hauptmann, Michael...
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...