2657 search results - page 182 / 532 » On the complexity of hierarchical problem solving |
126
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Cooperative coevolution has proven to be a promising technique for solving complex combinatorial optimization problems. In this paper, we present four different strategies which i...
113
click to vote
AIPS
2009
15 years 2 months ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
EOR
2007
15 years 1 months ago
2007
In this paper, we suggest a parallel algorithm based on a shared memory SIMD architecture for solving an n item subset-sum problem in time O(2n/2 /p) by using p = 2q processors, 0...
141
click to vote
DATESO
2009
14 years 11 months ago
2009
The Business Process Model represented as a diagram in Business Process Modeling Notation (BPMN) is a commonly used way how to describe business processes of an organization. Probl...
125
Voted
ADC
2006
Springer
15 years 7 months ago
2006
Springer
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...