5180 search results - page 663 / 1036 » Concurrency, Time, and Constraints |
214
click to vote
AIPS
2009
15 years 8 months ago
2009
In this paper we extend dynamic controllability of temporally-flexible plans to temporally-flexible reactive programs. We consider three reactive programming language constructs w...
162
click to vote
ANOR
2007
15 years 7 months ago
2007
We consider the problem of optimal position liquidation with the aim of maximizing the expected cash flow stream from the transaction in the presence of temporary or permanent ma...
172
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Non-adaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question...
144
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
152
click to vote
COR
2008
15 years 7 months ago
2008
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...