415 search results - page 23 / 83 » Optimal query complexity bounds for finding graphs |
135
click to vote
JMLR
2006
15 years 3 months ago
2006
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
138
click to vote
IJCAI
2007
15 years 4 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
142
click to vote
ATAL
2004
Springer
15 years 7 months ago
2004
Springer
The coalition formation process, in which a number of independent, autonomous agents come together to act as a collective, is an important form of interaction in multiagent system...
149
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
149
click to vote
JSA
2007
15 years 3 months ago
2007
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...