1054 search results - page 83 / 211 » Capacitated Domination Problem |
149
click to vote
CP
2011
Springer
14 years 2 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
134
click to vote
WINE
2005
Springer
15 years 8 months ago
2005
Springer
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...
117
click to vote
FOCM
2010
15 years 1 months ago
2010
Free-discontinuity problems describe situations where the solution of interest is defined by a function and a lower dimensional set consisting of the discontinuities of the funct...
132
click to vote
COCO
2004
Springer
15 years 6 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
140
click to vote
ICDM
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—We describe a novel application of using data mining and statistical learning methods to automatically monitor and detect abnormal execution traces from console logs in ...