6142 search results - page 336 / 1229 » The Complexity of Partition Functions |
178
click to vote
JUCS
2002
15 years 6 months ago
2002
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
216
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Many low-level vision algorithms assume a prior probability over images, and there has been great interest in trying to learn this prior from examples. Since images are very non G...
187
click to vote
IEEEPACT
2006
IEEE
16 years 21 days ago
2006
IEEE
Packet forwarding is a memory-intensive application requiring multiple accesses through a trie structure. The efficiency of a cache for this application critically depends on the ...
179
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We consider the issue of representing coalitional games in multiagent systems that exhibit externalities from coalition formation, i.e., systems in which the gain from forming a c...
165
click to vote
CADE
2007
Springer
16 years 7 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...