Sciweavers

2517 search results - page 280 / 504
» Specifying Weak Sets
Sort
View
PERCOM
2008
ACM
16 years 6 months ago
Structured decomposition of adaptive applications
We describe an approach to automate certain highlevel implementation decisions in a pervasive application, allowing them to be postponed until run time. Our system enables a model...
Justin Mazzola Paluska, Hubert Pham, Umar Saif, Gr...
INTENSIVE
2009
IEEE
16 years 1 months ago
A Service for Data-Intensive Computations on Virtual Clusters
Digital Preservation deals with the long-term storage, access, and maintenance of digital data objects. In order to prevent a loss of information, digital libraries and archives a...
Rainer Schmidt, Christian Sadilek, Ross King
DEXA
2009
Springer
167views Database» more  DEXA 2009»
16 years 1 months ago
Analyses and Validation of Conditional Dependencies with Built-in Predicates
Abstract. This paper proposes a natural extension of conditional functional dependencies (cfds [14]) and conditional inclusion dependencies (cinds [8]), denoted by cfdp s and cindp...
Wenguang Chen, Wenfei Fan, Shuai Ma
SCAM
2007
IEEE
16 years 28 days ago
Extending Attribute Grammars with Collection Attributes--Evaluation and Applications
Collection attributes, as defined by Boyland, can be used as a mechanism for concisely specifying cross-referencelike properties such as callee sets, subclass sets, and sets of v...
Eva Magnusson, Torbjörn Ekman, Görel Hed...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
16 years 25 days ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow