350 search results - page 42 / 70 » Lower and upper bounds on obtaining history independence |
129
click to vote
GLOBECOM
2007
IEEE
15 years 5 months ago
2007
IEEE
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 ...
109
click to vote
CAS
2008
15 years 1 months ago
2008
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...
123
click to vote
EOR
2010
15 years 1 months ago
2010
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...
111
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
— 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...
121
click to vote
KI
2008
Springer
15 years 1 months ago
2008
Springer
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 ...