481 search results - page 81 / 97 » Martin's game: a lower bound for the number of sets |
GECCO
2006
Springer
14 years 12 days ago
2006
Springer
This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other advance...
ISAAC
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
COCO
2010
Springer
14 years 20 days ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
ISTCS
1997
Springer
14 years 27 days ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
CP
2000
Springer
14 years 11 days ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...