Sciweavers

12052 search results - page 2360 / 2411
» compute 2010
Sort
View
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 11 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
CORR
2010
Springer
208views Education» more  CORR 2010»
13 years 11 months ago
Discovering potential user browsing behaviors using custom-built apriori algorithm
Most of the organizations put information on the web because they want it to be seen by the world. Their goal is to have visitors come to the site, feel comfortable and stay a whi...
Sandeep Singh Rawat, Lakshmi Rajamani
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 11 months ago
Improved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Elias P. Tsigaridas
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 11 months ago
Dependability in Aggregation by Averaging
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Paulo Jesus, Carlos Baquero, Paulo Sérgio A...
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 11 months ago
Open Graphs and Monoidal Theories
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of...
Lucas Dixon, Aleks Kissinger
« Prev « First page 2360 / 2411 Last » Next »