2509 search results - page 70 / 502 » Abstract Geometrical Computation and Computable Analysis |
126
click to vote
OPODIS
2003
15 years 2 months ago
2003
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
106
Voted
VTC
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract— In [1], we have recently proposed a general approach for approximating the power sum of Log–Normal Random Variables (RVs) by using the Pearson system of distributions...
131
click to vote
FUN
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
98
Voted
WAW
2004
Springer
15 years 6 months ago
2004
Springer
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
113
click to vote
TAMODIA
2007
15 years 1 months ago
2007
Abstract. Covering quality aspects such as usability through the software development life cycle is challenging. These “-ilities” are generally difficult to grasp and usually ...