The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetn...
In this paper we describe an algorithm for distributed, BDD-based bounded property checking and its implementation in the verification tool SymC. The distributed algorithm verifie...
Pradeep Kumar Nalla, Roland J. Weiss, Prakash Moha...
Network service providers purchase large point-to-point connections from network owners, then offer individual users network access at a price. Appropriately provisioning (purchas...
Abstract. An adaptive servomechanism is developed in the context of the problem of approximate or practical tracking (with prescribed asymptotic accuracy), by the system output, of...
Achim Ilchmann, Eugene P. Ryan, Christopher J. San...
Spoken dialogue systemperformance canvary widely fordifferentusers, aswell for the same userduring different dialogues.This paper presents the design and evaluation ofan adaptive v...