1725 search results - page 191 / 345 » Relaxed genetic programming |
142
click to vote
ESOP
2010
Springer
15 years 7 months ago
2010
Springer
Language-based information flow methods offer a principled way to enforce strong security properties, but enforcing noninterference is too inflexible for realistic applications. Se...
126
click to vote
EOR
2007
15 years 3 months ago
2007
We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and ea...
130
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
117
click to vote
MP
2010
14 years 10 months ago
2010
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...
136
click to vote
ICCS
2007
Springer
15 years 10 months ago
2007
Springer
Long-standing theoretical concerns about mutation accumulation within the human population can now be addressed with numerical simulation. We apply a biologically realistic forward...