2899 search results - page 38 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
DAGM
2005
Springer
15 years 6 months ago
2005
Springer
Filtering a signal with a finite impulse response (FIR) filter introduces dependencies between the errors in the filtered image due to overlapping filter masks. If the filteri...
111
click to vote
EDBT
2010
ACM
15 years 4 months ago
2010
ACM
A profound analysis of all relevant business data in the company is necessary for optimizing business processes effectively. Current analyses typically exclusively run on business...
114
click to vote
ACMICEC
2003
ACM
15 years 6 months ago
2003
ACM
This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexi...
DCC
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far ha...
114
click to vote
KR
2004
Springer
15 years 6 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...