Sciweavers

1248 search results - page 23 / 250
» On the Number of Birch Partitions
Sort
View
IJCAI
2001
13 years 10 months ago
Solving Factored MDPs via Non-Homogeneous Partitioning
This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...
Kee-Eung Kim, Thomas Dean
CORR
2006
Springer
73views Education» more  CORR 2006»
13 years 8 months ago
Stable partitions in coalitional games
We propose a notion of a stable partition in a coalitional game that is parametrized by the concept of a defection function. This function assigns to each partition of the grand c...
Krzysztof R. Apt, Tadeusz Radzik
ICCAD
1995
IEEE
108views Hardware» more  ICCAD 1995»
14 years 5 days ago
Partitioning and reduction of RC interconnect networks based on scattering parameter macromodels
This paper presents a linear time algorithm to reduce a large RC interconnect network into subnetworks which are approximated with lower order equivalent RC circuits. The number o...
Haifang Liao, Wayne Wei-Ming Dai
PE
2011
Springer
167views Optimization» more  PE 2011»
13 years 3 months ago
Passage-time computation and aggregation strategies for large semi-Markov processes
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
Marcel C. Guenther, Nicholas J. Dingle, Jeremy T. ...
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
14 years 2 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng