—A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels b...
Masoud Ebrahimi, Mohammad Ali Maddah-Ali, Amir K. ...
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
Abstract. Bounding the price of stability of undirected network design games with fair cost allocation is a challenging open problem in the Algorithmic Game Theory research agenda....
A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web serv...