Sciweavers

1258 search results - page 13 / 252
» Architecture-driven Problem Decomposition
Sort
View
AIPS
1994
13 years 8 months ago
A Framework for Automatic Problem Decomposition in Planning
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
Qiang Yang, Shuo Bai, Guiyou Qiu
PUK
2003
13 years 9 months ago
On the Decomposition and Concurrent Resolution of a Planning Problem
Planning is known to be a difficult task. One of the approaches used to reduce this difficulty is problem decomposition under divide-and-conquer methodology. This paper introduce...
Laura Sebastia, Eva Onaindia, Eliseo Marzal
TPDS
2002
126views more  TPDS 2002»
13 years 7 months ago
P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
Frank J. Seinstra, Dennis Koelma
4OR
2005
104views more  4OR 2005»
13 years 7 months ago
The robust shortest path problem with interval data via Benders decomposition
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
Roberto Montemanni, Luca Maria Gambardella
ICAC
2007
IEEE
14 years 1 months ago
Adaptive Multi-levels Dictionaries and Singular Value Decomposition Techniques for Autonomic Problem Determination
An autonomic problem determination system can adapt to changing environments, react to existing or new error condition and predict possible problems. In this report, we propose su...
Hoi Chan, Thomas Kwok