Sciweavers

846 search results - page 110 / 170
» On the Computational Complexity of Spatio-Temporal Logics
Sort
View
MIDDLEWARE
2004
Springer
15 years 11 months ago
On the benefits of decomposing policy engines into components
In order for middleware systems to be adaptive, their properties and services need to support a wide variety of application-specific policies. However, application developers and ...
Konstantin Beznosov
GRID
2005
Springer
15 years 11 months ago
Automatic clustering of grid nodes
— In a grid-computing environment, resource selection and scheduling depend on the network topology connecting the computation nodes. This paper presents a method to hierarchical...
Qiang Xu, Jaspal Subhlok
LISP
2008
96views more  LISP 2008»
15 years 6 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
BMCBI
2010
149views more  BMCBI 2010»
15 years 6 months ago
S3DB core: a framework for RDF generation and management in bioinformatics infrastructures
Background: Biomedical research is set to greatly benefit from the use of semantic web technologies in the design of computational infrastructure. However, beyond well defined res...
Jonas S. Almeida, Helena F. Deus, Wolfgang Maass
DAC
2006
ACM
16 years 7 months ago
Early cutpoint insertion for high-level software vs. RTL formal combinational equivalence verification
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
Xiushan Feng, Alan J. Hu