3946 search results - page 290 / 790 » The computational complexity of choice sets |
170
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...
204
click to vote
ANOR
2006
15 years 6 months ago
2006
In this paper we introduce a new formulation of the logistics network design problem encountered in deterministic, single-country, single-period contexts. Our formulation is flexi...
211
click to vote
JMIV
2007
15 years 6 months ago
2007
Illusorycontours,suchastheclassicalKanizsatriangleandsquare[9],areintrinsicphenomenainhuman vision. These contours are not completely defined by real object boundaries, but also i...
162
click to vote
ENTCS
2002
15 years 6 months ago
2002
Call-by-push-value is a "semantic machine code", providing a set of simple primitives from which both the call-by-value and call-by-name paradigms are built. We present i...
189
click to vote
PAMI
2007
15 years 6 months ago
2007
—The choice of a color model is of great importance for many computer vision algorithms (e.g., feature detection, object recognition, and tracking) as the chosen color model indu...