Sciweavers

3495 search results - page 101 / 699
» On the random satisfiable process
Sort
View
ECAI
1998
Springer
15 years 5 months ago
Optimal Scheduling of Dynamic Progressive Processing
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
Abdel-Illah Mouaddib, Shlomo Zilberstein
89
Voted
LICS
1992
IEEE
15 years 4 months ago
Equivalences on Observable Processes
The aim of this paper is to find the finest `observable' and `implementable' equivalence on concurrent processes. This is a part of a larger programme to develop a theor...
Irek Ulidowski
SIAMCO
2008
66views more  SIAMCO 2008»
15 years 22 days ago
Partial Information Linear Quadratic Control for Jump Diffusions
We study a stochastic control problem where the state process is described by a stochastic differential equation driven by a Brownian motion and a Poisson random measure, being af...
Yaozhong Hu, Bernt Oksendal
92
Voted
JCT
2007
108views more  JCT 2007»
15 years 21 days ago
The cover time of the preferential attachment graph
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...
Colin Cooper, Alan M. Frieze
CORR
2011
Springer
172views Education» more  CORR 2011»
14 years 7 months ago
Possibilities and impossibilities in Kolmogorov complexity extraction
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...
Marius Zimand