1355 search results - page 178 / 271 » Alternating Timed Automata over Bounded Time |
127
click to vote
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— In this paper, we consider the problem of stabilizing sufficiently smooth nonlinear time-invariant plants over a network whereby feedback is closed through a limitedba...
123
Voted
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— We consider a convex unconstrained optimization problem that arises in a network of agents whose goal is to cooperatively optimize the sum of the individual agent objec...
170
click to vote
LICS
1997
IEEE
15 years 7 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
119
click to vote
COMPGEOM
1995
ACM
15 years 6 months ago
1995
ACM
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
139
Voted
INFOCOM
1995
IEEE
15 years 6 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...