1760 search results - page 151 / 352 » Connected Set Cover Problem and Its Applications |
129
Voted
COLT
1993
Springer
15 years 7 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
182
Voted
ESANN
2000
15 years 4 months ago
2000
Abstract. In this paper, we presen t an algorithm that provides adaptive plasticity in function approximation problems: the deformable (feature) map (DM) algorithm. The DM approach...
114
click to vote
NETWORKING
2004
15 years 4 months ago
2004
The goal of this paper is to study pricing of differentiated services and its impact on the choice of service priority at equilibrium. We consider both TCP connections as well as n...
123
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Following the ideas of the Remote Procedure Call model, we have developed a logic programming counterpart, naturally called Prolog Remote Predicate Call (Prolog RPC) [1]. The Prol...
113
Voted
GD
1998
Springer
15 years 7 months ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...