Sciweavers

1998 search results - page 274 / 400
» Basic Association Rules
Sort
View
CSL
2006
Springer
15 years 6 months ago
Separation Logic for Higher-Order Store
Separation Logic is a sub-structural logic that supports local reasoning for imperative programs. It is designed to elegantly describe sharing and aliasing properties of heap struc...
Bernhard Reus, Jan Schwinghammer
DEXA
2006
Springer
141views Database» more  DEXA 2006»
15 years 6 months ago
Multi-term Web Query Expansion Using WordNet
In this paper, we propose a method for multi-term query expansions based on WordNet. In our approach, Hypernym/Hyponymy and Synonym relations in WordNet is used as the basic expans...
Zhiguo Gong, Chan Wa Cheang, Leong Hou U
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
15 years 6 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld
ACSD
2003
IEEE
105views Hardware» more  ACSD 2003»
15 years 6 months ago
Detecting State Coding Conflicts in STG Unfoldings Using SAT
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
Victor Khomenko, Maciej Koutny, Alexandre Yakovlev
CL
2000
Springer
15 years 6 months ago
Concurrent Constraint Programming with Process Mobility
Abstract. We propose an extension of concurrent constraint programming with primitives for process migration within a hierarchical network, and we study its semantics. To this purp...
David Gilbert, Catuscia Palamidessi