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...
Interactive query expansion (IQE) (c.f. Efthimiadis, 1996) is a potentially useful technique to help searchers formulate improved query statements, and ultimately retrieve better ...
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
This paper1 discusses the use of `conversational' or `dialogue games' as a basis for building dialogue systems. We give a tutorial overview of some recent attempts to re...
Wireless network access protocols can assist nodes to conserve energy by identifying when they can enter low energy states. The goal is to put all nodes not involved in a transmiss...