874 search results - page 128 / 175 » Computing Weighted Solutions in Answer Set Programming |
119
click to vote
ICALP
2005
Springer
15 years 8 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...
145
click to vote
CORR
2011
Springer
14 years 9 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...
184
click to vote
SSD
2007
Springer
15 years 8 months 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 ...
112
Voted
COMPGEOM
2006
ACM
15 years 8 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 ...
155
Voted
ECRTS
2006
IEEE
15 years 8 months 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...