CORR
2008
Springer
13 years 9 months ago
2008
Springer
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
-- Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination metho...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We consider a network of sensors deployed to sense a spatio-temporal field and infer parameters of interest about the field. We are interested in the case where each sensor's...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Continuing in the steps of Jon Kleinberg's and others celebrated work on decentralized search, we conduct an experimental analysis of destination sampling, a dynamic algorithm...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Let X[0..n - 1] and Y [0..m - 1] be two sorted arrays, and define the m
CORR
2008
Springer
13 years 9 months ago
2008
Springer
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
CORR
2008
Springer
13 years 9 months ago
2008
Springer
An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Although backpropagation ANNs generally predict better than decision trees do for pattern classification problems, they are often regarded as black boxes, i.e., their predictions c...