107 search results - page 7 / 22 » Combinatorial dichotomies in set theory |
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
84
Voted
MP
2002
14 years 10 months ago
2002
Using standard nonlinear programming (NLP) theory, we establish formulas for first and second order directional derivatives for optimal value functions of parametric mathematical ...
74
Voted
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
94
Voted
UAI
2004
14 years 11 months ago
2004
This paper describes a study of agent bidding strategies, assuming combinatorial valuations for complementary and substitutable goods, in three auction environments: sequential au...
104
Voted
DM
2011
14 years 1 months ago
2011
A relational first order structure is homogeneous if it is countable (possibly finite) and every isomorphism between finite substructures extends to an automorphism. This artic...