526 search results - page 77 / 106 » Efficient Algorithms for Online Decision Problems |
167
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
126
click to vote
TON
2008
15 years 4 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
132
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
133
click to vote
CMPB
2010
15 years 4 months ago
2010
Recent advances in 4D imaging and real-time imaging provide image data with clinically important cardiac dynamic information at high spatial or temporal resolution. However, the en...
130
click to vote
TCS
2008
15 years 4 months ago
2008
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...