Sciweavers

828 search results - page 120 / 166
» Bounded Hairpin Completion
Sort
View
CINQ
2004
Springer
116views Database» more  CINQ 2004»
14 years 1 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
CAAN
2006
Springer
14 years 1 months ago
Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...
Fredrik Manne, Qin Xin
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
14 years 1 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
IPPS
1998
IEEE
14 years 1 months ago
Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures
We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors eac...
Lars Lundberg, Håkan Lennerstad
PODS
1991
ACM
131views Database» more  PODS 1991»
14 years 1 months ago
Termination Detection in Logic Programs using Argument Sizes
d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...
Kirack Sohn, Allen Van Gelder