Sciweavers

37 search results - page 3 / 8
» Where the Typical Set Partitions Meet and Join
Sort
View
ECAI
2008
Springer
13 years 9 months ago
Optimal Coalition Structure Generation In Partition Function Games
1 In multi-agent systems (MAS), coalition formation is typically studied using characteristic function game (CFG) representations, where the performance of any coalition is indepen...
Tomasz P. Michalak, Andrew Dowell, Peter McBurney,...
RECOMB
2001
Springer
14 years 7 months ago
Class discovery in gene expression data
Recent studies (Alizadeh et al, [1]; Bittner et al,[5]; Golub et al, [11]) demonstrate the discovery of putative disease subtypes from gene expression data. The underlying computa...
Amir Ben-Dor, Nir Friedman, Zohar Yakhini
PRDC
2008
IEEE
14 years 1 months ago
SOQ: A Service-Oriented Quorum-Based Protocol for Resilient Real-Time Communication in Partitionable Networks
We consider efficient real-time communication mechanisms for applications in unreliable and partitionable networks, where network partitions can occur unpredictably and nodes can ...
Bo Zhang, Binoy Ravindran
IROS
2006
IEEE
155views Robotics» more  IROS 2006»
14 years 1 months ago
Multiple Hypothesis Tracking of Clusters of People
— Mobile robots operating in populated environments typically can improve their service and navigation behavior when they know where people are in their vicinity and in which dir...
Manuel Mucientes, Wolfram Burgard
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
14 years 1 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner