Sciweavers

2107 search results - page 195 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
IAT
2007
IEEE
15 years 10 months ago
A Distributed Algorithm for Finding Nucleolus-Stable Payoff Divisions
The agents in multiagent systems can coordinate their actions and handle tasks jointly by forming coalitions. One of the important steps in this process is the fair division of pa...
Hrishikesh J. Goradia, José M. Vidal
139
Voted
AUSAI
2001
Springer
15 years 7 months ago
Further Pruning for Efficient Association Rule Discovery
The Apriori algorithm's frequent itemset approach has become the standard approach to discovering association rules. However, the computation requirements of the frequent item...
Songmao Zhang, Geoffrey I. Webb
GI
2007
Springer
15 years 10 months ago
On Sensor Scheduling in Case of Unreliable Communication
: This paper deals with the linear discrete-time sensor scheduling problem in unreliable communication networks. In case of the common assumption of an errorfree communication, the...
Marco F. Huber, Eric Stiegeler, Uwe D. Hanebeck
BMCBI
2006
129views more  BMCBI 2006»
15 years 4 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...
WEBDB
2010
Springer
155views Database» more  WEBDB 2010»
15 years 9 months ago
Learning Topical Transition Probabilities in Click Through Data with Regression Models
The transition of search engine users’ intents has been studied for a long time. The knowledge of intent transition, once discovered, can yield a better understanding of how diļ...
Xiao Zhang, Prasenjit Mitra