Sciweavers

48 search results - page 4 / 10
» Division algorithms for Bernstein polynomials
Sort
View
TCS
2010
13 years 2 months ago
Non-confluence in divisionless P systems with active membranes
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...
Antonio E. Porreca, Giancarlo Mauri, Claudio Zandr...
ATAL
2001
Springer
13 years 12 months ago
A Stable and Feasible Payoff Division for Coalition Formation in a Class of Task Oriented Domains
In the last few years the use of coalition formation algorithms in multi-agent systems has been proposed as a possible way of modelling autonomous agent cooperation. Game theory pr...
María-Victoria Belmonte, Ricardo Conejo, Jo...
JSC
2006
102views more  JSC 2006»
13 years 7 months ago
Counting and locating the solutions of polynomial systems of maximum likelihood equations, I
In statistics, mixture models consisting of several component subpopulations are used widely to model data drawn from heterogeneous sources. In this paper, we consider maximum lik...
Max-Louis G. Buot, Donald St. P. Richards
WAIFI
2010
Springer
192views Mathematics» more  WAIFI 2010»
14 years 15 days ago
Type-II Optimal Polynomial Bases
In the 1990s and early 2000s several papers investigated the relative merits of polynomial-basis and normal-basis computations for F2n . Even for particularly squaring-friendly app...
Daniel J. Bernstein, Tanja Lange
CORR
2008
Springer
82views Education» more  CORR 2008»
13 years 7 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard