Sciweavers

8437 search results - page 1392 / 1688
» Preferences over Sets
Sort
View
LCTRTS
2004
Springer
16 years 3 days ago
Finding effective compilation sequences
Most modern compilers operate by applying a fixed, program-independent sequence of optimizations to all programs. Compiler writers choose a single “compilation sequence”, or ...
L. Almagor, Keith D. Cooper, Alexander Grosul, Tim...
260
Voted
PSSE
2004
Springer
16 years 3 days ago
Developing and Reasoning About Probabilistic Programs in pGCL
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...
Annabelle McIver, Carroll Morgan
VLDB
2004
ACM
151views Database» more  VLDB 2004»
16 years 2 days ago
Query Rewrite for XML in Oracle XML DB
Oracle XML DB integrates XML storage and querying using the Oracle relational and object relational framework. It has the capability to physically store XML documents by shredding...
Muralidhar Krishnaprasad, Zhen Hua Liu, Anand Mani...
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
16 years 2 days ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
AGILEDC
2003
IEEE
16 years 1 days ago
YP and Urban Simulation: Applying an Agile Programming Methodology in a Politically Tempestuous Domain
YP is an agile programming methodology that has evolved over the past 15 years. Many of its features are common to other agile methodologies; its novel features include using a hi...
Bjørn N. Freeman-Benson, Alan Borning
« Prev « First page 1392 / 1688 Last » Next »