127 search results - page 6 / 26 » Aggregates in Constraint Handling Rules |
GECCO
2008
Springer
15 years 1 days 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...
IS
2002
14 years 10 months ago
2002
In this paper, we explore the possibility of transforming queries with minimum and maximum predicates into equivalent queries that can be computed more efficiently. The main contr...
AISC
2006
Springer
15 years 2 months ago
2006
Springer
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...
SAC
2002
ACM
14 years 10 months ago
2002
ACM
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...
125
click to vote
SSD
2007
Springer
15 years 5 months ago
2007
Springer
We address continuously processing an aggregation join query over data streams. Queries of this type involve both join and aggregation operations, with windows specified on join ...