Sciweavers

3250 search results - page 607 / 650
» An Algorithm to Solve a Linear Program
Sort
View
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 8 months ago
Sensor Networks with Random Links: Topology Design for Distributed Consensus
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
Soummya Kar, José M. F. Moura
SIGOPS
2008
141views more  SIGOPS 2008»
13 years 8 months ago
Using model checkers in an introductory course on operating systems
During the last three years, we have been experimenting with the use of the Uppaal model checker in an introductory course on operating systems for first-year Computer Science stu...
Roelof Hamberg, Frits W. Vaandrager
BMCBI
2005
99views more  BMCBI 2005»
13 years 8 months ago
Effective ambiguity checking in biosequence analysis
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
Janina Reeder, Peter Steffen, Robert Giegerich
TOG
2008
96views more  TOG 2008»
13 years 8 months ago
Display adaptive tone mapping
We propose a tone-mapping operator that can minimize visible contrast distortions for a range of output devices, ranging from e-paper to HDR displays. The operator weights contras...
Rafal Mantiuk, Scott Daly, Louis Kerofsky
MP
1998
76views more  MP 1998»
13 years 8 months ago
Warm start of the primal-dual method applied in the cutting-plane scheme
A practical warm-start procedure is described for the infeasible primal-dualinterior-point method employed to solve the restricted master problem within the cutting-plane method. ...
Jacek Gondzio