Sciweavers

3356 search results - page 143 / 672
» Determining Consensus Numbers
Sort
View
AMAI
2006
Springer
13 years 10 months ago
Bargaining over multiple issues in finite horizon alternating-offers protocol
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
Francesco Di Giunta, Nicola Gatti
NETWORKS
2008
13 years 10 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
COLING
2002
13 years 10 months ago
Disambiguation of Finite-State Transducers
The objective of this work is to disambiguate transducers which have the following form: T = R D and to be able to apply the determinization algorithm described in (Mohri, 1997)....
N. Smaili, Patrick Cardinal, Gilles Boulianne, Pie...
MCS
2002
Springer
13 years 9 months ago
Forward and Backward Selection in Regression Hybrid Network
Abstract. We introduce a Forward Backward and Model Selection algorithm (FBMS) for constructing a hybrid regression network of radial and perceptron hidden units. The algorithm det...
Shimon Cohen, Nathan Intrator
MOC
1998
85views more  MOC 1998»
13 years 9 months ago
Remarks on the Schoof-Elkies-Atkin algorithm
Abstract. Schoof’s algorithm computes the number m of points on an elliptic curve E defined over a finite field Fq. Schoof determines m modulo small primes using the character...
L. Dewaghe