Sciweavers

850 search results - page 108 / 170
» A Logic Programming Language Based on Binding Algebras
Sort
View
SDB
1995
178views Database» more  SDB 1995»
15 years 4 months ago
A Semantics-based Approach to Design of Query Languages for Partial Information
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Leonid Libkin
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
15 years 8 months ago
Characterizing the genetic programming environment for fifth (GPE5) on a high performance computing cluster
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
Kenneth Holladay
SEW
2006
IEEE
15 years 7 months ago
Integrating Probability with Time and Shared-Variable Concurrency
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...
Huibiao Zhu, Shengchao Qin, Jifeng He, Jonathan P....
ITCC
2005
IEEE
15 years 7 months ago
Formalisation and implementation of Access control models
Access control software must be based on a security policy model. Flaws in them may come from a lack of precision or some incoherences in the policy model or from inconsistencies ...
Mathieu Jaume, Charles Morisset
ENTCS
2008
91views more  ENTCS 2008»
15 years 1 months ago
Towards Concrete Syntax Patterns for Logic-based Transformation Rules
Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmer...
Malte Appeltauer, Günter Kniesel