100 search results - page 14 / 20 » Combination of Lower Bounds in Exact BDD Minimization |
ESA
2006
Springer
14 years 2 months ago
2006
Springer
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
MA
2010
Springer
13 years 9 months ago
2010
Springer
Model selection by the predictive least squares (PLS) principle has been thoroughly studied in the context of regression model selection and autoregressive (AR) model order estima...
CP
2006
Springer
14 years 2 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
JSAC
2008
13 years 10 months ago
2008
We consider a wireless collision channel, shared by a finite number of users who transmit to a common base station. Each user wishes to minimize its average transmission rate (or p...
COMBINATORICS
2000
13 years 10 months ago
2000
Given a space endowed with symmetry, we define ms(, r) to be the maximum of m such that for any r-coloring of there exists a monochromatic symmetric set of size at least m. We c...