Sciweavers

2736 search results - page 434 / 548
» Implementable allocation rules
Sort
View
104
Voted
ICFP
2004
ACM
16 years 17 days ago
Translating dependency into parametricity
Abadi et al. introduced the dependency core calculus (DCC) as a unifying framework to study many important program analyses such as binding time, information flow, slicing, and fu...
Stephen Tse, Steve Zdancewic
103
Voted
ICFP
2002
ACM
16 years 17 days ago
Packrat parsing: : simple, powerful, lazy, linear time, functional pearl
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
92
Voted
ICDE
2010
IEEE
170views Database» more  ICDE 2010»
16 years 11 days ago
Workload Driven Index Defragmentation
Decision support queries that scan large indexes can suffer significant degradation in I/O performance due to index fragmentation. DBAs rely on rules of thumb that use index size a...
Manoj Syamala, Vivek R. Narasayya
101
Voted
PERCOM
2006
ACM
16 years 6 days ago
Composition Trust Bindings in Pervasive Computing Service Composition
In pervasive computing, devices or peers may implement or compose services using services from other devices or peers, and may use components from various sources. A composition t...
John Buford, Rakesh Kumar, Greg Perkins
ICCAD
2002
IEEE
146views Hardware» more  ICCAD 2002»
15 years 9 months ago
Conflict driven learning in a quantified Boolean Satisfiability solver
Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification ...
Lintao Zhang, Sharad Malik