903 search results - page 101 / 181 » Non-well-founded trees in categories |
154
click to vote
CIKM
2005
Springer
15 years 12 months ago
2005
Springer
The basic relationships to be determined in XML query processing are ancestor-descendant (A-D), parent-child (P-C), sibling and ordering relationships. The containment labeling sc...
120
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
We propose a new methodology to look at the fitness contributions (semantics) of different schemata in Genetic Programming (GP). We hypothesize that the significance of a schem...
170
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
158
click to vote
DOCENG
2004
ACM
15 years 11 months ago
2004
ACM
This paper describes a tool for recombining the logical structure from an XML document with the typeset appearance of the corresponding PDF document. The tool uses the XML represe...
271
click to vote
ISSTA
2004
ACM
15 years 11 months ago
2004
ACM
We show how model checking and symbolic execution can be used to generate test inputs to achieve structural coverage of code that manipulates complex data structures. We focus on ...