Sciweavers

1237 search results - page 211 / 248
» Partitions and the Fermi-Dirac Distribution
Sort
View
ATAL
2006
Springer
14 years 2 months ago
Learning to identify winning coalitions in the PAC model
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
Ariel D. Procaccia, Jeffrey S. Rosenschein
EURONGI
2006
Springer
14 years 2 months ago
The Challenges of Merging Two Similar Structured Overlays: A Tale of Two Networks
Structured overlay networks is an important and interesting primitive that can be used by diverse peer-to-peer applications. Multiple overlays can result either because of network ...
Anwitaman Datta, Karl Aberer
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
14 years 2 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
APNOMS
2008
Springer
14 years 1 months ago
A Logical Group Formation and Management Mechanism Using RSSI for Wireless Sensor Networks
Abstract. Wireless sensor network is a suitable technology for ubiquitous environment. However, in WSN, as the network size grows larger, overheads such as flooding, calculation an...
Jihyuk Heo, Jin Ho Kim, Choong Seon Hong
ICWS
2010
IEEE
14 years 13 days ago
Highly Scalable Web Service Composition Using Binary Tree-Based Parallelization
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
Patrick Hennig, Wolf-Tilo Balke