Sciweavers

2681 search results - page 131 / 537
» Problem F
Sort
View
IJAR
2006
103views more  IJAR 2006»
13 years 10 months ago
Computing mean and variance under Dempster-Shafer uncertainty: Towards faster algorithms
In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster-Shafer uncertainty, we only know the masses m...
Vladik Kreinovich, Gang Xiang, Scott Ferson
SIAMSC
2011
148views more  SIAMSC 2011»
13 years 4 months ago
Bootstrap AMG
We develop an algebraic multigrid (AMG) setup scheme based on the bootstrap framework for multiscale scientific computation. Our approach uses a weighted least squares definition...
Achi Brandt, James J. Brannick, K. Kahl, Irene Liv...
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
12 years 23 days ago
Approximate duality of multicommodity multiroute flows and cuts: single source case
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
Petr Kolman, Christian Scheideler
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
14 years 2 months ago
Inside a predator-prey model for multi-objective optimization: a second study
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
Christian Grimme, Karlheinz Schmitt
ICCAD
1997
IEEE
75views Hardware» more  ICCAD 1997»
14 years 2 months ago
An exact gate decomposition algorithm for low-power technology mapping
With the remarkable growth of portable application and the increasing frequency and integration density, power is being given comparable weight to speed and area in IC designs. In...
Hai Zhou, D. F. Wong