Sciweavers

1480 search results - page 102 / 296
» Ants can solve constraint satisfaction problems
Sort
View
AINA
2006
IEEE
15 years 3 months ago
Partitioned optimization algorithms for multiple sequence alignment
Multiple sequence alignment is an important and difficult problem in molecular biology and bioinformatics. In this paper, we propose a partitioning approach that significantly impr...
Yixin Chen, Yi Pan, Juan Chen, Wei Liu, Ling Chen
CONEXT
2010
ACM
14 years 7 months ago
NEVERMIND, the problem is already fixed: proactively detecting and troubleshooting customer DSL problems
Traditional DSL troubleshooting solutions are reactive, relying mainly on customers to report problems, and tend to be labor-intensive, time consuming, prone to incorrect resoluti...
Yu Jin, Nick G. Duffield, Alexandre Gerber, Patric...
DSS
2008
127views more  DSS 2008»
14 years 9 months ago
Cross-lingual thesaurus for multilingual knowledge management
The Web is a universal repository of human knowledge and culture which has allowed unprecedented sharing of ideas and information in a scale never seen before. It can also be cons...
Christopher C. Yang, Chih-Ping Wei, K. W. Li
DSS
2007
113views more  DSS 2007»
14 years 9 months ago
An associate constraint network approach to extract multi-lingual information for crime analysis
International crime and terrorism have drawn increasing attention in recent years. Retrieving relevant information from criminal records and suspect communications is important in...
Christopher C. Yang, Kar Wing Li
COCOON
2005
Springer
15 years 3 months ago
Some New Results on Inverse Sorting Problems
Abstract. In this paper, we consider two types of inverse sorting problems. The first type is an inverse sorting problem under weighted Hamming distance with bound constraints, wh...
Xiaoguang Yang, Jianzhong Zhang 0001