Sciweavers

1884 search results - page 240 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
AUTOMATICA
2002
81views more  AUTOMATICA 2002»
15 years 5 months ago
The explicit linear quadratic regulator for constrained systems
For discrete-time linear time invariant systems with constraints on inputs and states, we develop an algorithm to determine explicitly, the state feedback control law which minimi...
Alberto Bemporad, Manfred Morari, Vivek Dua, Efstr...
SIGMETRICS
2002
ACM
117views Hardware» more  SIGMETRICS 2002»
15 years 4 months ago
Context-aware TCP/IP
Abstract-This paper discusses the design and evaluation of CATNIP, a ContextAware Transport/Network Internet Protocol for the Web. This integrated protocol uses application-layer k...
Carey L. Williamson, Qian Wu
152
Voted
RTS
2011
123views more  RTS 2011»
15 years 1 days ago
Feasibility analysis under fixed priority scheduling with limited preemptions
—Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non preemptive executi...
Gang Yao, Giorgio C. Buttazzo, Marko Bertogna
TON
2012
13 years 7 months ago
Opportunistic Spectrum Access in Multiple-Primary-User Environments Under the Packet Collision Constraint
—Cognitive Radio (CR) technology has great potential to alleviate spectrum scarcity in wireless communications. It allows secondary users (SUs) to opportunistically access spectr...
Eric Jung, Xin Liu
WADS
2007
Springer
104views Algorithms» more  WADS 2007»
15 years 11 months ago
Faster Approximation of Distances in Graphs
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Piotr Berman, Shiva Prasad Kasiviswanathan