1054 search results - page 45 / 211 » Capacitated Domination Problem |
124
Voted
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
107
Voted
AAAI
2007
15 years 4 months ago
2007
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
116
click to vote
PUC
2007
15 years 2 months ago
2007
Ubiquitous computing is unusual amongst technological research arenas. Most areas of computer science research, such as programming language implementation, distributed operating s...
106
click to vote
COLT
1992
Springer
15 years 6 months ago
1992
Springer
We consider PAC-learning where the distribution is known to the student. The problem addressed here is characterizing when learnability with respect to distribution D1 implies lea...
122
click to vote
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
In this paper, we generalize the replacement rules based on the dominance relation in multiobjective optimization. Ordinary two replacement rules based on the dominance relation ar...