14165 search results - page 650 / 2833 » The generalized two-server problem |
219
click to vote
ICALP
1992
Springer
15 years 11 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
196
click to vote
COLT
2004
Springer
15 years 11 months ago
2004
Springer
This paper introduces a new method using dyadic decision trees for estimating a classification or a regression function in a multiclass classification problem. The estimator is bas...
189
click to vote
ECAI
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. In this work we address the problem of elaborating domain descriptions (alias action theories), in particular those that are expressed in dynamic logic. We define a gener...
172
click to vote
ESA
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
161
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
Abstract A central problem in embedded system co-synthesis is the generation of software for lowlevel I O. Scheduling still remains a manual task because existing coarse-grained re...