3415 search results - page 525 / 683 » Lower Bounds for Kernelizations |
255
click to vote
AMMA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper, we report on the design of a novel market-based approach for decentralised scheduling across multiple factories. Specifically, because of the limitations ...
140
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
138
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
154
Voted
WADS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
176
click to vote
DEXA
2009
Springer
15 years 11 months ago
2009
Springer
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...