Sciweavers

8828 search results - page 1765 / 1766
» Formal methods in practice
Sort
View
EDBT
2012
ACM
247views Database» more  EDBT 2012»
11 years 9 months ago
Heuristics-based query optimisation for SPARQL
Query optimization in RDF Stores is a challenging problem as SPARQL queries typically contain many more joins than equivalent relational plans, and hence lead to a large join orde...
Petros Tsialiamanis, Lefteris Sidirourgos, Irini F...
ICSE
2012
IEEE-ACM
11 years 9 months ago
On the naturalness of software
—Natural languages like English are rich, complex, and powerful. The highly creative and graceful use of languages like English and Tamil, by masters like Shakespeare and Avvaiya...
Abram Hindle, Earl T. Barr, Zhendong Su, Mark Gabe...
SIAMCOMP
2002
138views more  SIAMCOMP 2002»
13 years 6 months ago
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
Hsien-Kuei Hwang, Ralph Neininger
WWW
2003
ACM
14 years 7 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
IJCAI
1989
13 years 8 months ago
A Theorem Prover for Prioritized Circumscription
In a recent paper, Ginsberg shows how a backward-chaining ATMS can be used to construct a theorem prover for circumscription. Here, this work is extended to handle prioritized cir...
Andrew B. Baker, Matthew L. Ginsberg
« Prev « First page 1765 / 1766 Last » Next »