321 search results - page 7 / 65 » Partitioning by iterative deletion |
DAGSTUHL
2007
13 years 11 months ago
2007
Iterative aggregation/disaggregation methods (IAD) belong to competitive tools for computation the characteristics of Markov chains as shown in some publications devoted to testing...
TARK
2009
Springer
14 years 4 months ago
2009
Springer
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty ...
COMPGEOM
2006
ACM
14 years 4 months ago
2006
ACM
Snap Rounding (SR for short) is a method for converting arbitrary-precision arrangements of line segments into a fixed-precision representation. In the previous years two variant...
WG
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
CASES
2007
ACM
14 years 2 months ago
2007
ACM
We present an efficient framework for dynamic reconfiguration of application-specific custom instructions. A key component of this framework is an iterative algorithm for temporal...