Sciweavers

2254 search results - page 304 / 451
» Computing the minimal covering set
Sort
View
WIOPT
2010
IEEE
15 years 4 months ago
Routing games : From egoism to altruism
The paper studies the routing in the network shared by several users. Each user seeks to optimize either its own performance or some combination between its own performance and tha...
Amar Prakash Azad, Eitan Altman, Rachid El Azouzi

Publication
172views
16 years 8 months ago
The Spatial Patterns Affecting Home to Work Distances of Two-Worker Households
Round-trips between home and work represent, for the majority of people, most of their daily commuting time; also, setting home and work places involves more constraints for two- ...
Surprenant-Legault, J and El-Geneidy A.
SDM
2009
SIAM
251views Data Mining» more  SDM 2009»
16 years 3 months ago
High Performance Parallel/Distributed Biclustering Using Barycenter Heuristic.
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
Alok N. Choudhary, Arifa Nisar, Waseem Ahmad, Wei-...
SIAMDM
2002
94views more  SIAMDM 2002»
15 years 5 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
MP
2010
119views more  MP 2010»
15 years 4 months ago
Efficient and fair routing for mesh networks
Inspired by the One Laptop Per Child project, we consider mesh networks that connect devices that cannot recharge their batteries easily. We study how the mesh should retransmit in...
Andrea Lodi, Enrico Malaguti, Nicolás E. St...