2657 search results - page 121 / 532 » On the complexity of hierarchical problem solving |
160
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
142
click to vote
IAT
2005
IEEE
16 years 3 days ago
2005
IEEE
Our previous research presents a methodology of cooperative problem solving for BDI systems, based on a complete formal theory. This covers both a static part, defining individua...
182
click to vote
ISAAC
2004
Springer
15 years 12 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
143
click to vote
CPM
1999
Springer
15 years 10 months ago
1999
Springer
In sequencing by hybridization (SBH), one has to reconstruct a sequence from its l-long substrings. SBH was proposed as an alternative to gel-based DNA sequencing approaches, but ...
183
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...