1258 search results - page 32 / 252 » Architecture-driven Problem Decomposition |
LCPC
1997
Springer
14 years 27 days ago
1997
Springer
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
UAI
2008
13 years 10 months ago
2008
This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to ...
ACSD
2006
IEEE
14 years 2 months ago
2006
IEEE
— When synthesising an asynchronous circuit from an STG, one often encounters the state explosion problem. In order to alleviate this problem one can decompose the STG into small...
AAAI
2006
13 years 10 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
MATES
2009
Springer
14 years 3 months ago
2009
Springer
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from th...