2168 search results - page 259 / 434 » Randomized Algorithms and Complexity Theory |
148
Voted
TSP
2011
14 years 10 months ago
2011
—This paper addresses the independent component analysis (ICA) of quaternion random vectors. In particular, we focus on the Gaussian case and therefore only consider the quaterni...
115
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Software testing can be re-formulated as a search problem, hence search algorithms (e.g., Genetic Algorithms) can be used to tackle it. Most of the research so far has been of emp...
112
Voted
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
125
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we examine how adding objectives to a given optimization problem affects the computation effort required to generate the set of Pareto-optimal solutions. Experime...
113
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Learning goal-scoring behaviour from scratch for simulated robot soccer is considered to be a very difficult problem, and is often achieved by endowing players with an innate set ...