Sciweavers

503 search results - page 50 / 101
» If not now, when
Sort
View
EOR
2008
78views more  EOR 2008»
13 years 11 months ago
Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
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...
Haye Lau, Shoudong Huang, Gamini Dissanayake
BC
2006
63views more  BC 2006»
13 years 11 months ago
A Quantitative Theory of Neural Computation
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...
Leslie G. Valiant
IJFCS
2008
49views more  IJFCS 2008»
13 years 10 months ago
A Markovian Approach for the Analysis of the gene Structure
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...
Christelle Melo de Lima, Laurent Gueguen, Christia...
IANDC
2006
103views more  IANDC 2006»
13 years 10 months ago
Bisimulation and cocongruence for probabilistic systems
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...
Vincent Danos, Josee Desharnais, François L...
IJHPCA
2006
109views more  IJHPCA 2006»
13 years 10 months ago
A Resource Leasing Policy for on-Demand Computing
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...
Darin England, Jon B. Weissman