Sciweavers

680 search results - page 22 / 136
» Computational Complexity and Anytime Algorithm for Inconsist...
Sort
View
AIPS
2004
13 years 9 months ago
Incremental Maximum Flows for Fast Envelope Computation
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
Nicola Muscettola
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 1 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
GECCO
2005
Springer
116views Optimization» more  GECCO 2005»
14 years 1 months ago
Measuring, enabling and comparing modularity, regularity and hierarchy in evolutionary design
For computer-automated design systems to scale to complex designs they must be able to produce designs that exhibit the characteristics of modularity, regularity and hierarchy –...
Gregory Hornby
CEC
2007
IEEE
13 years 11 months ago
Efficient relevance estimation and value calibration of evolutionary algorithm parameters
Calibrating the parameters of an evolutionary algorithm (EA) is a laborious task. The highly stochastic nature of an EA typically leads to a high variance of the measurements. The ...
Volker Nannen, A. E. Eiben
IJCAI
2007
13 years 9 months ago
Relevance Estimation and Value Calibration of Evolutionary Algorithm Parameters
— Calibrating the parameters of an evolutionary algorithm (EA) is a laborious task. The highly stochastic nature of an EA typically leads to a high variance of the measurements. ...
Volker Nannen, A. E. Eiben