3780 search results - page 226 / 756 » Algorithms for Game Metrics |
151
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total...
171
click to vote
IJCGA
2008
15 years 7 months ago
2008
Given a set S of n point sites in the plane, the City Voronoi diagram partitions the plane into the Voronoi regions of the sites, with respect to the City metric. This metric is i...
157
click to vote
IJBIDM
2007
15 years 7 months ago
2007
: The k-nearest neighbour (KNN) technique is a simple yet effective method for classification. In this paper, we propose an efficient weighted nearest neighbour classification algo...
153
click to vote
IFIP
2003
Springer
16 years 10 days ago
2003
Springer
Bluetooth specification still has open issues, including the intra and interpiconet scheduling topics. This paper proposes an interpiconet scheduling algorithm, referred to as AIS...
178
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...