874 search results - page 128 / 175 » Computing Weighted Solutions in Answer Set Programming |
162
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
190
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—We present controllers that enable mobile robots to persistently monitor or sweep a changing environment. The changing environment is modeled as a field which grows in location...
232
click to vote
SSD
2007
Springer
16 years 3 days ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
157
click to vote
COMPGEOM
2006
ACM
15 years 12 months ago
2006
ACM
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
194
click to vote
ECRTS
2006
IEEE
16 years 1 days ago
2006
IEEE
We study the problem of dynamically scheduling a set of state-feedback control tasks controlling a set of linear plants. We consider an on-line non-preemptive scheduling policy th...