Sciweavers

9119 search results - page 150 / 1824
» A Simultaneous Search Problem
Sort
View
112
Voted
FUN
2007
Springer
80views Algorithms» more  FUN 2007»
15 years 4 months ago
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
Shlomi Dolev, Hen Fitoussi
IPL
2006
104views more  IPL 2006»
15 years 24 days ago
The communication complexity of the Hamming distance problem
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
99
Voted
RECOMB
2007
Springer
15 years 7 months ago
Parts of the Problem of Polyploids in Rearrangement Phylogeny
Abstract. Genome doubling simultaneously doubles all genetic markers. Genome rearrangement phylogenetics requires that all genomes analyzed have the same set of orthologs, so that ...
Chunfang Zheng, Qian Zhu, David Sankoff
78
Voted
CISIS
2009
IEEE
15 years 7 months ago
Multiple-Paths Search with Concurrent Thread Scheduling for Fast AND/OR Tree Search
This paper proposes a fast AND/OR tree search algorithm using a multiple-paths concurrent search method. Conventional heuristic AND/OR tree search algorithms expand nodes in only ...
Fumiyo Takano, Yoshitaka Maekawa, Hironori Kasahar...
EDBT
2011
ACM
254views Database» more  EDBT 2011»
14 years 4 months ago
SocialSearch: enhancing entity search with social network matching
This paper introduces the problem of matching people names to their corresponding social network identities such as their Twitter accounts. Existing tools for this purpose build u...
Gae-won You, Seung-won Hwang, Zaiqing Nie, Ji-Rong...