490 search results - page 6 / 98 » Impossibilities for roommate problems |
CEC
2010
IEEE
13 years 4 months ago
2010
IEEE
Several constraint handling techniques have been proposed to be used with the evolutionary algorithms (EAs). According to the no free lunch theorem, it is impossible for a single c...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
The multi-label problem is of fundamental importance to computer vision, yet finding global minima of the associated energies is very hard and usually impossible in practice. Rec...
ESA
2011
Springer
12 years 7 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
TARK
2007
Springer
14 years 1 months ago
2007
Springer
We examine four approaches for dealing with the logical omniscience problem and their potential applicability: the syntactic approach, awareness, algorithmic knowledge, and imposs...
ACL
1992
13 years 8 months ago
1992
An algorithm is proposed to determine antecedents for VP ellipsis. The algorithm eliminates impossible antecedents, and then imposes a preference ordering on possible antecedents....