Sciweavers

1699 search results - page 140 / 340
» A Rule Format for Associativity
Sort
View
CP
2011
Springer
14 years 5 months ago
Pruning Rules for Constrained Optimisation for Conditional Preferences
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
Nic Wilson, Walid Trabelsi
WWW
2002
ACM
16 years 6 months ago
An event-condition-action language for XML
XML repositories are now a widespread means for storing and exchanging information on the Web. As these repositories become increasingly used in dynamic applications such as e-com...
James Bailey, Alexandra Poulovassilis, Peter T. Wo...
ALT
2002
Springer
16 years 3 months ago
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
Dietrich Braess, Jürgen Forster, Tomas Sauer,...
159
Voted
ESSOS
2009
Springer
15 years 10 months ago
Idea: Measuring the Effect of Code Complexity on Static Analysis Results
Abstract. To understand the effect of code complexity on static analysis, thirty-five format string vulnerabilities were studied. We analyzed two code samples for each vulnerabilit...
James Walden, Adam Messer, Alex Kuhl
DSVIS
1995
Springer
15 years 9 months ago
Moving between Contexts
Any action is performed in a particular context. So what does it mean to do the ‘same’ thing in a different context? There is no simple answer to this question , it depends on ...
Alan J. Dix