Sciweavers

1389 search results - page 242 / 278
» Parallel Algorithms for Treewidth Two
Sort
View
PLDI
2005
ACM
15 years 3 months ago
Demystifying on-the-fly spill code
Modulo scheduling is an effective code generation technique that exploits the parallelism in program loops by overlapping iterations. One drawback of this optimization is that reg...
Alex Aletà, Josep M. Codina, Antonio Gonz&a...
JCO
2010
99views more  JCO 2010»
14 years 8 months ago
Online scheduling with a buffer on related machines
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
György Dósa, Leah Epstein
COLCOM
2008
IEEE
15 years 4 months ago
Replication in Overlay Networks: A Multi-objective Optimization Approach
Recently, overlay network-based collaborative applications such as instant messaging, content sharing, and Internet telephony are becoming increasingly popular. Many of these appli...
Osama Al-Haj Hassan, Lakshmish Ramaswamy, John A. ...
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
15 years 1 months ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza
BMCBI
2005
147views more  BMCBI 2005»
14 years 9 months ago
Calibration of mass spectrometric peptide mass fingerprint data without specific external or internal calibrants
Background: Peptide Mass Fingerprinting (PMF) is a widely used mass spectrometry (MS) method of analysis of proteins and peptides. It relies on the comparison between experimental...
Witold E. Wolski, Maciej Lalowski, Peter Jungblut,...