1686 search results - page 148 / 338 » Programs as polygraphs: computability and complexity |
137
Voted
SEW
2006
IEEE
15 years 9 months ago
2006
IEEE
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...
123
Voted
EUROPAR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Program transformations are one of the most valuable compiler techniques to improve data locality. However, restructuring compilers have a hard time coping with data depe...
128
Voted
IPCO
2008
15 years 5 months ago
2008
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
160
Voted
IDA
2008
Springer
15 years 3 months ago
2008
Springer
We developed Relational Data Mining approach which allows to overcome essential limitations of the Data Mining and Knowledge Discovery techniques. In the paper the approach was im...
122
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...