148 search results - page 7 / 30 » Data Structures with Arithmetic Constraints: A Non-disjoint ... |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
There has been little attention to search based test data generation in the presence of pointer inputs and dynamic data structures, an area in which recent concolic methods have e...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
We present a novel framework for mapping between any combination of XML and relational schemas, in which a high-level, userspecified mapping is translated into semantically meanin...
CP
2003
Springer
14 years 20 days ago
2003
Springer
In this paper, we present an algorithm to propagate an n-ary constraint (with n greater than 2) specifying the relative positions of points in a three-dimensional rigid group. The ...
LFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
JMLR
2010
13 years 2 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...