Sciweavers

778 search results - page 110 / 156
» Expressiveness and complexity of graph logic
Sort
View
ER
2007
Springer
127views Database» more  ER 2007»
14 years 5 months ago
Update XML Data by Using Graphical Languages
To be a full-featured data exchange format, XML should support not only queries but also updates on its contents. The new W3C XML update facility has proposed a set of operators (...
Wei Ni, Tok Wang Ling
INFORMATICALT
2007
127views more  INFORMATICALT 2007»
13 years 11 months ago
Composition of Loop Modules in the Structural Blanks Approach to Programming with Recurrences: A Task of Synthesis of Nested Loo
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
Vytautas Cyras
PADS
2009
ACM
14 years 5 months ago
An Approach for Validation of Semantic Composability in Simulation Models
Semantic composability aims to ensure that the composition of simulation components is meaningful in terms of their expressed behavior, and achieves the desired objective of the n...
Claudia Szabo, Yong Meng Teo
DSS
2008
130views more  DSS 2008»
13 years 11 months ago
Knowledge representation concepts for automated SLA management
Outsourcing of complex IT infrastructure to IT service providers has increased substantially during the past years. IT service providers must be able to fulfil their service-qualit...
Adrian Paschke, Martin Bichler
LCC
1994
248views Algorithms» more  LCC 1994»
14 years 3 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin