17760 search results - page 306 / 3552 » A Generalization of the Massey-Ding Algorithm |
209
Voted
ICALT
2006
IEEE
16 years 24 days ago
2006
IEEE
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
205
click to vote
ICICIC
2006
IEEE
16 years 24 days ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
190
click to vote
ICRA
2005
IEEE
16 years 10 days ago
2005
IEEE
— We present a fast method for solving rigid body contact problems with friction, based on optimizations incorporated into Lemke’s algorithm for solving linear complementarity ...
169
click to vote
AE
2005
Springer
16 years 9 days ago
2005
Springer
This work proposes a new rule pruning procedure for Ant-Miner, an Ant Colony algorithm that discovers classification rules in the context of data mining. The performance of Ant-Min...
190
click to vote
CPM
2005
Springer
16 years 8 days ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...