Sciweavers

204 search results - page 17 / 41
» A Half-Million Strong at Least
Sort
View
CORR
2010
Springer
109views Education» more  CORR 2010»
14 years 9 months ago
Fast simulation of large-scale growth models
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a "least action principle"...
Tobias Friedrich, Lionel Levine
ORL
2008
90views more  ORL 2008»
14 years 9 months ago
Optimal bundle pricing with monotonicity constraint
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
Alexander Grigoriev, Joyce van Loon, Maxim Sviride...
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
14 years 8 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
ICCAD
2010
IEEE
125views Hardware» more  ICCAD 2010»
14 years 7 months ago
Peak current reduction by simultaneous state replication and re-encoding
Reducing circuit's peak current plays an important role in circuit reliability in deep sub-micron era. For sequential circuits, it is observed that the peak current has a str...
Junjun Gu, Gang Qu, Lin Yuan, Qiang Zhou
BMCBI
2010
121views more  BMCBI 2010»
14 years 4 months ago
G-stack modulated probe intensities on expression arrays - sequence corrections and signal calibration
Background: The brightness of the probe spots on expression microarrays intends to measure the abundance of specific mRNA targets. Probes with runs of at least three guanines (G) ...
Mario Fasold, Peter F. Stadler, Hans Binder