503 search results - page 50 / 101 » If not now, when |
88
Voted
EOR
2008
15 years 22 days ago
2008
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
73
Voted
BC
2006
15 years 22 days ago
2006
We show how a general quantitative theory of neural computation can be used to explain two recent experimental findings in neuroscience. The first of these findings is that in hum...
72
Voted
IJFCS
2008
15 years 21 days ago
2008
Hidden Markov models (HMMs) are effective tools to detect series of statistically homogeneous structures, but they are not well suited to analyse complex structures. Numerous meth...
105
Voted
IANDC
2006
15 years 21 days ago
2006
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
97
Voted
IJHPCA
2006
15 years 20 days ago
2006
Leasing computational resources for on-demand computing is now a viable option for providers of network services. Temporary spikes or lulls in demand for a service can be accommod...