236 search results - page 29 / 48 » heuristics 2002 |
STOC
2005
ACM
15 years 10 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
158
click to vote
VLDB
2002
ACM
15 years 10 months ago
2002
ACM
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
SIGMOD
2002
ACM
15 years 9 months ago
2002
ACM
Physical database design is important for query performance in a shared-nothing parallel database system, in which data is horizontally partitioned among multiple independent node...
ICCAD
2002
IEEE
15 years 6 months ago
2002
IEEE
This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the...
ICCAD
2002
IEEE
15 years 6 months ago
2002
IEEE
Application-specific instructions can significantly improve the performance, energy, and code size of configurable processors. A common approach used in the design of such instruc...