6142 search results - page 395 / 1229 » The Complexity of Partition Functions |
181
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
182
click to vote
CPC
2004
15 years 6 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
165
click to vote
CTRSA
2006
Springer
15 years 10 months ago
2006
Springer
In this work, we initiate the study of realizing a ranking functionality (m1,
157
click to vote
RAS
2006
15 years 6 months ago
2006
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
190
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...