1380 search results - page 101 / 276 » A General Polynomial Sieve |
96
Voted
PPAM
2005
Springer
15 years 6 months ago
2005
Springer
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous av...
116
click to vote
AISC
2008
Springer
15 years 3 months ago
2008
Springer
We use higher-order logic to verify a quantifier elimination procedure for linear arithmetic over ordered fields, where the coefficients of variables are multivariate polynomials o...
102
Voted
MOC
1998
15 years 22 days ago
1998
A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented...
102
Voted
CORR
2010
Springer
15 years 20 days ago
2010
Springer
Abstract. We introduce a new class of games called the networked common goods game (NCGG), which generalizes the well-known common goods game [12]. We focus on a fairly general sub...
96
Voted
INFORMS
2010
14 years 10 months ago
2010
Two-step MIR inequalities are valid inequalities derived from a facet of a simple mixedinteger set with three variables and one constraint. In this paper we investigate how to eff...