639 search results - page 9 / 128 » Dominance Constraints with Set Operators |
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
AIR
2004
13 years 7 months ago
2004
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
CPAIOR
2005
Springer
14 years 27 days ago
2005
Springer
A cardinality constraint imposes that each value of a set V must be taken a certain number of times by a set of variables X, whereas an among constraint imposes that a certain numb...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
In this paper, a multiobjective (MO) learning approach to image feature extraction is described, where Pareto-optimal interest point (IP) detectors are synthesized using genetic p...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We provide an epistemic analysis of arbitrary strategic games based on possibility correspondences. Such an analysis calls for the use of transfinite iterations of the correspond...