1204 search results - page 77 / 241 » Termination of Polynomial Programs |
132
click to vote
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
133
click to vote
AGP
2003
IEEE
15 years 6 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
119
Voted
ICDCS
2002
IEEE
15 years 5 months ago
2002
IEEE
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
78
Voted
ADC
2004
Springer
15 years 6 months ago
2004
Springer
XML is becoming the dominant standard for representing and exchanging data on the World Wide Web. The ability to transform and present data in XML is crucial and XSLT (Extensible ...
112
Voted
ICMLA
2007
15 years 2 months ago
2007
Gene Expression Programming (GEP) is an evolutionary algorithm that incorporates both the idea of a simple, linear chromosome of fixed length used in Genetic Algorithms (GAs) and...