804 search results - page 111 / 161 » On the Termination of the Chase Algorithm |
89
Voted
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
108
click to vote
IJCNN
2007
IEEE
15 years 7 months ago
2007
IEEE
— Using the classical Parzen window estimate as the target function, the kernel density estimation is formulated as a regression problem and the orthogonal forward regression tec...
111
Voted
MIDDLEWARE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Grids are becoming more and more dynamic, running parallel applications on large scale and heterogeneous resources. Explicitly stopping a whole distributed application is...
114
Voted
ASPDAC
2006
ACM
15 years 6 months ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
106
click to vote
RTSS
2005
IEEE
15 years 6 months ago
2005
IEEE
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...