Sciweavers

6365 search results - page 267 / 1273
» Fast Local Computation Algorithms
Sort
View
IWCMC
2006
ACM
16 years 18 days ago
Detecting spatial congestion in multihop wireless networks
While TCP is highly successful in the wire-line Internet, its performance fast degrades as the number of hops increases in multihop wireless networks. It is due to not only the ha...
Changhee Joo, Saewoong Bahk, Hyogon Kim
EOR
2007
364views more  EOR 2007»
15 years 6 months ago
Heuristics for the mirrored traveling tournament problem
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
Celso C. Ribeiro, Sebastián Urrutia
TCBB
2011
15 years 1 months ago
Accurate Construction of Consensus Genetic Maps via Integer Linear Programming
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
Yonghui Wu, Timothy J. Close, Stefano Lonardi
CORR
2010
Springer
182views Education» more  CORR 2010»
15 years 6 months ago
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
Yashodhan Kanoria, Mohsen Bayati, Christian Borgs,...
SIGMOD
2008
ACM
157views Database» more  SIGMOD 2008»
16 years 6 months ago
CRD: fast co-clustering on large datasets utilizing sampling-based matrix decomposition
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
Feng Pan, Xiang Zhang, Wei Wang 0010