450 search results - page 58 / 90 » The Complexity of Computing Minimal Unidirectional Covering ... |
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
The instruction sets of general-purpose microprocessors are designed to offer good performance across a wide range of programs. The size and complexity of the instruction sets, how...
123
click to vote
GECCO
2010
Springer
14 years 10 months ago
2010
Springer
Evolutionary multi-objective optimization deals with the task of computing a minimal set of search points according to a given set of objective functions. The task has been made e...
WIDM
2003
ACM
15 years 5 months ago
2003
ACM
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...
TAMC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
INFORMS
1998
14 years 11 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...