6598 search results - page 307 / 1320 » Graph Theory with Applications |
176
click to vote
IJAR
2008
15 years 5 months ago
2008
We consider here the case where our knowledge is partial and based on a betting density function which is n-dimensional Gaussian. The explicit formulation of the least committed b...
159
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...
135
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Let H = (V, E) be a hypergraph. A conflict-free coloring of H is an assignment of colors to V such that in each hyperedge e E there is at least one uniquely-colored vertex. This ...
168
click to vote
EUROPAR
2004
Springer
15 years 10 months ago
2004
Springer
Abstract This paper proposes an approach to continuously optimizing parallel scientific applications with dynamically changing architectures. We achieve this by combining a dynamic...
169
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
We study the Cost-Per-Action or Cost-Per-Acquisition (CPA) charging scheme in online advertising. In this scheme, instead of paying per click, the advertisers pay only when a user...