2060 search results - page 62 / 412 » Some Applications of Coding Theory in Computational Complexi... |
GECCO
2008
Springer
14 years 10 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...
SIGMOD
2004
ACM
15 years 10 months ago
2004
ACM
This demo presents an extension of a declarative language for specifying data-intensive Web applications. We demonstrate a scenario extracted from a real-life application, the Web...
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
Computing optimal strategies to commit to in general normal-form or Bayesian games is a topic that has recently been gaining attention, in part due to the application of such algo...
CIE
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
114
click to vote
GECCO
2011
Springer
14 years 1 months ago
2011
Springer
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...