Sciweavers

2205 search results - page 338 / 441
» Mutation Operators for Specifications
Sort
View
124
Voted
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 2 months ago
A Logic Programming Framework for Combinational Circuit Synthesis
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...
Paul Tarau, Brenda Luderman
117
Voted
CORR
2008
Springer
120views Education» more  CORR 2008»
15 years 2 months ago
XQuery Join Graph Isolation
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional X...
Torsten Grust, Manuel Mayr, Jan Rittinger
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 2 months ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
DEBU
2008
118views more  DEBU 2008»
15 years 2 months ago
Big, Fast XQuery: Enabling Content Applications
Increasingly, companies recognize that most of their important information does not exist in relational stores but in documents. For a long time, textual information has been rela...
Mary Holstege
133
Voted
ENTCS
2008
100views more  ENTCS 2008»
15 years 2 months ago
A Calculus for Team Automata
Team automata are a formalism for the component-based specification of reactive, distributed systems. Their main feature is a flexible technique for specifying coordination patter...
Maurice H. ter Beek, Fabio Gadducci, Dirk Janssens