1303 search results - page 140 / 261 » Cyclic Association Rules |
175
click to vote
LPAR
2004
Springer
15 years 11 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
165
click to vote
LOPSTR
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
184
click to vote
PVLDB
2010
15 years 4 months ago
2010
Our analysis of many real-world event based applications has revealed that existing Complex Event Processing technology (CEP), while effective for efficient pattern matching on e...
165
click to vote
FOSSACS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. A syntactic framework called SGSOS, for defining well-behaved Markovian stochastic transition systems, is introduced by analogy to the GSOS congruence format for nondeter...
179
click to vote
EUSFLAT
2003
15 years 7 months ago
2003
We present a modification of the vehicle routing problem with the additional restriction that time windows are associated with each customer by defining an interval wherein the cu...