Sciweavers

468 search results - page 22 / 94
» One-Way Functions in Complexity Theory
Sort
View
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
15 years 4 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
15 years 5 months ago
Policy teaching through reward function learning
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, ...
Haoqi Zhang, David C. Parkes, Yiling Chen
SMI
2005
IEEE
15 years 4 months ago
Maximizing Adaptivity in Hierarchical Topological Models
We present an approach to hierarchically encode the topology of functions over triangulated surfaces. We describe the topology of a function by its Morse-Smale complex, a well kno...
Peer-Timo Bremer, Valerio Pascucci, Bernd Hamann
RAS
2006
111views more  RAS 2006»
14 years 11 months ago
Robot learning through task identification
The operation of an autonomous mobile robot in a semi-structured environment is a complex, usually non-linear and partly unpredictable process. Lacking a theory of robot
Ulrich Nehmzow, Roberto Iglesias, Theocharis Kyria...
BIRTHDAY
2010
Springer
15 years 3 days ago
Halting and Equivalence of Program Schemes in Models of Arbitrary Theories
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
Dexter Kozen