420 search results - page 16 / 84 » Some Algorithmic Problems in Polytope Theory |
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— This paper is concerned with understanding the connection between the existing Internet congestion control algorithms and the optimal control theory. The available resource all...
116
click to vote
NFM
2011
14 years 4 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
126
click to vote
STOC
2000
ACM
15 years 2 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
SACI
2007
IEEE
15 years 3 months ago
2007
IEEE
: Linear Parameter Varying(LPV) systems appear in a form of LTI state space representations where the elements of the A(ρ), B(ρ), C(ρ) matrices can depend on an unknown but at a...
92
Voted
SIGMETRICS
2010
ACM
14 years 8 months ago
2010
ACM
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...