371 search results - page 25 / 75 » An anytime algorithm for optimal coalition structure generat... |
180
click to vote
CEC
2008
IEEE
16 years 2 days ago
2008
IEEE
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...
177
Voted
HIPEAC
2010
Springer
15 years 7 months ago
2010
Springer
This paper presents a program generator for fast software Viterbi decoders for arbitrary convolutional codes. The input to the generator is a specification of the code and a single...
149
Voted
KR
2004
Springer
15 years 11 months ago
2004
Springer
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
164
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
145
click to vote
ICTAI
2009
IEEE
16 years 7 days ago
2009
IEEE
A multiobjective genetic algorithm to uncover community structure in complex network is proposed. The algorithm optimizes two objective functions able to identify densely connecte...