2137 search results - page 125 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
193
Voted
AI
2011
Springer
15 years 1 days ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
149
click to vote
WADS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
147
Voted
COCO
2004
Springer
15 years 8 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
132
click to vote
IPCCC
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
161
click to vote
PKDD
2007
Springer
15 years 11 months ago
2007
Springer
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...