Sciweavers

557 search results - page 66 / 112
» Useful Transformations in Answer set programming
Sort
View
ICFP
2008
ACM
14 years 8 months ago
Compiling self-adjusting programs with continuations
Self-adjusting programs respond automatically and efficiently to input changes by tracking the dynamic data dependences of the computation and incrementally updating the output as...
Ruy Ley-Wild, Matthew Fluet, Umut A. Acar
COMSIS
2004
110views more  COMSIS 2004»
13 years 7 months ago
Generating XML Based Specifications of Information Systems
This paper outlines a methodology for designing information systems based on XML. The methodology uses XML DTDs to define the design standards, and the structure and constraints of...
Miro Govedarica, Ivan Lukovic, Pavle Mogin
FOCS
2008
IEEE
14 years 2 months ago
Unique Games with Entangled Provers are Easy
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
Julia Kempe, Oded Regev, Ben Toner
EDBT
2009
ACM
113views Database» more  EDBT 2009»
14 years 2 months ago
Query ranking in probabilistic XML data
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
Lijun Chang, Jeffrey Xu Yu, Lu Qin
GECCO
2009
Springer
166views Optimization» more  GECCO 2009»
14 years 2 months ago
Genetic programming in the wild: evolving unrestricted bytecode
We describe a methodology for evolving Java bytecode, enabling the evolution of extant, unrestricted Java programs, or programs in other languages that compile to Java bytecode. B...
Michael Orlov, Moshe Sipper