Sciweavers

14386 search results - page 26 / 2878
» The Chinese Generals Problem
Sort
View
CORR
2002
Springer
90views Education» more  CORR 2002»
14 years 11 months ago
Mostly-Unsupervised Statistical Segmentation of Japanese Kanji Sequences
Given the lack of word delimiters in written Japanese, word segmentation is generally considered a crucial first step in processing Japanese texts. Typical Japanese segmentation a...
Rie Kubota Ando, Lillian Lee
SIGIR
2010
ACM
14 years 6 months ago
Efficient partial-duplicate detection based on sequence matching
With the ever-increasing growth of the Internet, numerous copies of documents become serious problem for search engine, opinion mining and many other web applications. Since parti...
Qi Zhang, Yue Zhang, Haomin Yu, Xuanjing Huang
IEEECIT
2010
IEEE
14 years 9 months ago
Applying Two New Methods to the Teaching of Computer Architecture
In undergraduate teaching, Computer Architecture (CA) is one of the courses with more systematic, nsive and abstract knowledge. In current Chinese universities, how to bring up und...
Zhigang Gao, Ganggang Xue, Guojun Dai, Xuehui Wei
IJCNN
2000
IEEE
15 years 4 months ago
The Cellular Simultaneous Recurrent Network Adaptive Critic Design for the Generalized Maze Problem Has a Simple Closed-Form Sol
The generalized maze problem has been considered as an interesting testbed by various researchers in AI and neural networks. The most significantresults, fiom a neural networks po...
Donald C. Wunsch
ORL
2006
114views more  ORL 2006»
14 years 11 months ago
A (1-1/e)-approximation algorithm for the generalized assignment problem
We give a (1 - 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every ...
Zeev Nutov, Israel Beniaminy, Raphael Yuster