268 search results - page 4 / 54 » Mixing time for the solid-on-solid model |
ATAL
2010
Springer
14 years 12 months ago
2010
Springer
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determinati...
IPPS
1996
IEEE
15 years 3 months ago
1996
IEEE
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...
110
click to vote
WSOM
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We show how the “Online Sparse Coding Neural Gas” algorithm can be applied to a more realistic model of the “Cocktail Party Problem”. We consider a setting where ...
111
click to vote
MONET
2002
14 years 11 months ago
2002
This paper describes a framework for selecting the optimal call mix to be admitted while employing a bandwidth degradation policy in a wireless cellular network. The optimal proper...
FDL
2005
IEEE
15 years 5 months ago
2005
IEEE
The support of heterogeneity at the specification level, that is, the ability to mix several models of computation (MoCs) in the system-level specification, is becoming increasing...