16188 search results - page 2564 / 3238 » The Optimal PAC Algorithm |
221
click to vote
TAMC
2009
Springer
15 years 11 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
191
click to vote
SIGMOD
1999
ACM
15 years 11 months ago
1999
ACM
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
221
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
211
click to vote
RTSS
1992
IEEE
15 years 11 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
199
click to vote
CASES
2007
ACM
15 years 11 months ago
2007
ACM
For memory constrained environments like embedded systems, optimization for program size is often as important, if not more important, as optimization for execution speed. Commonl...