Sciweavers

1380 search results - page 101 / 276
» A General Polynomial Sieve
Sort
View
PPAM
2005
Springer
14 years 3 months ago
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints
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...
Krzysztof Giaro, Marek Kubale
AISC
2008
Springer
14 years 19 hour ago
Parametric Linear Arithmetic over Ordered Fields in Isabelle/HOL
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...
Amine Chaieb
MOC
1998
111views more  MOC 1998»
13 years 9 months ago
The approximation power of moving least-squares
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...
David Levin
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 9 months ago
The Networked Common Goods Game
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...
Jinsong Tan
INFORMS
2010
100views more  INFORMS 2010»
13 years 7 months ago
Two-Step MIR Inequalities for Mixed Integer Programs
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...
Sanjeeb Dash, Marcos Goycoolea, Oktay Günl&uu...