Sciweavers

4095 search results - page 119 / 819
» How to test a tree
Sort
View
FLAIRS
1998
13 years 11 months ago
Variants of Validity and their Impact on the Overall Test Space
Dealingwiththequestionwhetherornota givensystemdoessulllcesomeinterestingpropertyoneisconfrontedwiththeproblem,how tonavigateappropriatelythroughtheavailable knowledgespacetoprove...
Jörg Herrmann, Klaus P. Jantke, Rainer Knauf
RTA
2000
Springer
14 years 1 months ago
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
Linear Second-Order Unification and Context Unification are closely related problems. However, their equivalence was never formally proved. Context unification is a restriction of ...
Jordi Levy, Mateu Villaret
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
14 years 1 months ago
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
ACL
2007
13 years 11 months ago
A Symbolic Approach to Near-Deterministic Surface Realisation using Tree Adjoining Grammar
Surface realisers divide into those used in generation (NLG geared realisers) and those mirroring the parsing process (Reversible realisers). While the first rely on grammars not...
Claire Gardent, Eric Kow
CHI
2007
ACM
14 years 10 months ago
Tracking the interaction of users with ajax applications for usability testing
In this paper, we introduce an implementation for detailed monitoring of user actions on web pages. It addresses the problem that the log data recorded by standard web servers is ...
Richard Atterer, Albrecht Schmidt