Sciweavers

350 search results - page 42 / 70
» Lower and upper bounds on obtaining history independence
Sort
View
GLOBECOM
2007
IEEE
15 years 3 months ago
Scaling Laws for Delay Sensitive Traffic in Rayleigh Fading Networks
The throughput of delay sensitive traffic in a Rayleigh fading network is studied by adopting a scaling limit approach. The case of study is that of a pair of nodes establishing a ...
Nikhil Karamchandani, Massimo Franceschetti
CAS
2008
118views more  CAS 2008»
14 years 12 months ago
A Novel Method for Measuring the Structural Information Content of Networks
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
Matthias Dehmer
EOR
2010
98views more  EOR 2010»
14 years 12 months ago
Lagrangean duals and exact solution to the capacitated p-center problem
In this work we study the Capacitated p-Center Problem (CpCP) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP, and we pro...
Maria Albareda-Sambola, Juan A. Díaz, Elena...
CDC
2008
IEEE
126views Control Systems» more  CDC 2008»
15 years 6 months ago
Conditions for tracking in networked control systems
— In this paper we obtain information theoretical conditions for tracking in linear time-invariant control systems. We consider the particular case where the closed loop contains...
Ivan Lopez Hurtado, Chaouki T. Abdallah, Sudharman...
KI
2008
Springer
14 years 11 months ago
Shallow Models for Non-iterative Modal Logics
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Lutz Schröder, Dirk Pattinson