550 search results - page 53 / 110 » Optimization and Approximation Problems Related to Polynomia... |
GECCO
1999
Springer
14 years 1 months ago
1999
Springer
This paper uses the GP paradigm to evolve linear genotypes (individuals) that consist of Java byte code. Our prototype GP system is implemented in Java using a standard Java devel...
PODS
2006
ACM
14 years 9 months ago
2006
ACM
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
It has been shown empirically that the XCS classifier system solves typical classification problems in a machine learning competitive way. However, until now, no learning time es...
JWSR
2007
13 years 8 months ago
2007
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
POPL
2003
ACM
14 years 9 months ago
2003
ACM
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...