699 search results - page 89 / 140 » Generalized Distance Functions in the Theory of Computation |
118
click to vote
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
This paper is concerned with a specific brand of evolutionary algorithms: Memetic algorithms. A new local search technique with an adaptive neighborhood setting process is introdu...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
WSC
2008
15 years 3 days ago
2008
We extend the basic theory of kriging, as applied to the design and analysis of deterministic computer experiments, to the stochastic simulation setting. Our goal is to provide fl...
100
click to vote
WWW
2004
ACM
15 years 10 months ago
2004
ACM
Learning styles, as well as the best ways of responding with corresponding instructional strategies, have been intensively studied in the classical educational (classroom) setting...