914 search results - page 177 / 183 » Branch and Bound on the Network Model |
136
click to vote
STOC
1993
ACM
15 years 1 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
TSP
2010
14 years 4 months ago
2010
We formulate and study a decentralized multi-armed bandit (MAB) problem. There are distributed players competing for independent arms. Each arm, when played, offers i.i.d. reward a...
HPDC
2007
IEEE
15 years 3 months ago
2007
IEEE
We study stochastic models to mitigate the risk of poor Quality-of-Service (QoS) in computational markets. Consumers who purchase services expect both price and performance guaran...
78
Voted
SIAMSC
2008
14 years 9 months ago
2008
We develop a computational method for simulating models of gel dynamics where the gel is described by two phases, a networked polymer and a fluid solvent. The models consist of tra...
VISUALIZATION
2005
IEEE
15 years 3 months ago
2005
IEEE
Existing parallel or remote rendering solutions rely on communicating pixels, OpenGL commands, scene-graph changes or application-specific data. We propose an intermediate soluti...