5130 search results - page 395 / 1026 » Constraint Query Languages |
166
click to vote
ICDT
1995
ACM
15 years 10 months ago
1995
ACM
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
168
click to vote
CC
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
157
click to vote
CP
2005
Springer
16 years 8 days ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
159
click to vote
CP
2004
Springer
16 years 4 days ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
153
click to vote
UM
2010
Springer
15 years 11 months ago
2010
Springer
Recently, detectors of gaming the system have been developed for several intelligent tutoring systems where the problem-solving process is reified, and gaming consists of systemati...