1554 search results - page 42 / 311 » Parameterized Complexity and Approximation Algorithms |
100
click to vote
ISAAC
2000
Springer
15 years 1 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
ALT
2004
Springer
15 years 7 months ago
2004
Springer
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
92
Voted
COCO
2004
Springer
15 years 1 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
SIGMOD
2001
ACM
15 years 10 months ago
2001
ACM
Caching approximate values instead of exact values presents an opportunity for performance gains in exchange for decreased precision. To maximize the performance improvement, cach...
87
Voted
ICCS
2007
Springer
15 years 4 months ago
2007
Springer
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the ...