14518 search results - page 56 / 2904 » Two Problems for Sophistication |
GECCO
2003
Springer
14 years 2 months ago
2003
Springer
We identify classes of functions for which a No Free Lunch result does and does not hold, with particular emphasis on the relationship between No Free Lunch and problem description...
IJBC
2008
13 years 9 months ago
2008
In this work we study some properties associated with the bordercollision bifurcations in a two-dimensional piecewise linear map in canonical form, related to the case in which a ...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
IOR
2010
13 years 7 months ago
2010
This paper introduces disjunctive decomposition for two-stage mixed 0-1 stochastic integer programs (SIPs) with random recourse. Disjunctive decomposition allows for cutting plane...
ACSC
2005
IEEE
14 years 2 months ago
2005
IEEE
Support for program understanding in development and maintenance tasks can be facilitated by program analysis techniques. Both control-flow and data-flow analysis can support pr...