15033 search results - page 62 / 3007 » Complexity Theory and Algorithms |
125
Voted
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
131
Voted
CAV
2006
Springer
15 years 7 months ago
2006
Springer
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for system synthesis, litt...
125
Voted
AAAI
1990
15 years 4 months ago
1990
This paper studies sorted generalization-the generalization, with respect to an arbitrary taxonomic theory, of atomic formulas containing sorted variables. It develops an algorith...
126
Voted
ECAL
2005
Springer
15 years 9 months ago
2005
Springer
An evolutionary reinforcement-learning algorithm, the operation of which was not associated with an optimality condition, was instantiated in an artificial organism. The algorithm ...
139
click to vote
PODS
2010
ACM
15 years 8 months ago
2010
ACM
Abiteboul et al. initiated the systematic study of distributed XML documents consisting of several logical parts, possibly located on different machines. The physical distributio...