7978 search results - page 283 / 1596 » Representation before computation |
131
click to vote
MFCS
1994
Springer
15 years 10 months ago
1994
Springer
We introduce the notion of empty alternation by investigating alternating automata which are restricted to empty their storage except for a logarithmically space-bounded tape befor...
167
click to vote
APCSAC
2001
IEEE
15 years 10 months ago
2001
IEEE
During processor design, it is often necessary to evaluate multiple cache configurations. This paper describes the design and implementation of a retargetable on-line cache simula...
158
click to vote
GREC
2009
Springer
15 years 10 months ago
2009
Springer
This paper tries to sum up the discussions held during the sessions of GREC’09, as well as at the final panel session. As it is always good to know where you are coming from, th...
184
click to vote
WSC
2007
15 years 9 months ago
2007
Network reduction techniques are mainly used with exact approaches such as factoring to compute network reliability. However, exact computation of network reliability is feasible ...
173
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemm...