Sciweavers

279 search results - page 15 / 56
» Reduction approaches for robust shortest path problems
Sort
View
JAIR
2002
106views more  JAIR 2002»
14 years 9 months ago
Collective Intelligence, Data Routing and Braess' Paradox
We consider the problem of designing the the utility functions of the utility-maximizing agents in a multi-agent system (MAS) so that they work synergistically to maximize a globa...
David Wolpert, Kagan Tumer
EUROPAR
2007
Springer
15 years 3 months ago
New Approaches for Relay Selection in IEEE 802.16 Mobile Multi-hop Relay Networks
The IEEE 802.16 mobile multi-hop relay (MMR) task group ’j’ (TGj) has recently introduced the multi-hop relaying concept in the IEEE 802.16 WirelessMAN, wherein a newly introdu...
Deepesh Man Shrestha, Sung-Hee Lee, Sung-Chan Kim,...
COMSWARE
2007
IEEE
15 years 4 months ago
Topology-based Clusterhead Candidate Selection in Wireless Ad-hoc and Sensor Networks
—Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. Neighboring devices elect one appropriate device as clusterhead. Due t...
Matthias R. Brust, Adrian Andronache, Steffen Roth...
IBPRIA
2007
Springer
14 years 11 months ago
A Density-Based Data Reduction Algorithm for Robust Estimators
In this paper we present a non parametric density-based data reduction technique designed to be used in robust parameter estimation problems. Existing approaches are focused on red...
Luis Ferraz, Ramon Lluis Felip, Brais Martí...
ICDE
2010
IEEE
260views Database» more  ICDE 2010»
15 years 9 months ago
Anonymizing Weighted Social Network Graphs
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
Sudipto Das, Ömer Egecioglu, Amr El Abbadi