2922 search results - page 84 / 585 » Scalable Algorithms for Distribution Search |
101
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
105
click to vote
CSB
2005
IEEE
15 years 7 months ago
2005
IEEE
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
117
Voted
PODC
2009
ACM
15 years 8 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
106
click to vote
EMNLP
2004
15 years 3 months ago
2004
Paraphrase recognition is a critical step for natural language interpretation. Accordingly, many NLP applications would benefit from high coverage knowledge bases of paraphrases. ...
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
Despite the many research efforts invested recently in peerto-peer search engines, none of the proposed system has reached the level of quality and efficiency of their centralized...