144 search results - page 20 / 29 » Solving Regular Tree Grammar Based Constraints |
104
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
PASTE
2004
ACM
15 years 5 months ago
2004
ACM
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
TCBB
2008
14 years 11 months ago
2008
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
125
click to vote
ISCAS
2008
IEEE
15 years 6 months ago
2008
IEEE
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
PODS
2007
ACM
15 years 11 months ago
2007
ACM
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...