Sciweavers

4983 search results - page 895 / 997
» order 2008
Sort
View
TCS
2008
13 years 8 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
IOR
2007
106views more  IOR 2007»
13 years 8 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker
IPL
2007
143views more  IPL 2007»
13 years 8 months ago
The cycle roommates problem: a hard case of kidney exchange
Recently, a number of interesting algorithmic problems have arisen from the emergence, in a number of countries, of kidney exchange schemes, whereby live donors are matched with r...
Robert W. Irving
IPM
2007
182views more  IPM 2007»
13 years 8 months ago
A probabilistic music recommender considering user opinions and audio features
A recommender system has an obvious appeal in an environment where the amount of on-line information vastly outstrips any individual’s capability to survey. Music recommendation...
Qing Li, Sung-Hyon Myaeng, Byeong Man Kim
IPM
2007
106views more  IPM 2007»
13 years 8 months ago
Patent document categorization based on semantic structural information
The number of patent documents is currently rising rapidly worldwide, creating the need for an automatic categorization system to replace time-consuming and labor-intensive manual...
Jae-Ho Kim, Key-Sun Choi