2340 search results - page 138 / 468 » Copying and Comparing: Problems and Solutions |
200
click to vote
AAAI
2000
15 years 7 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
151
click to vote
ECIR
2006
Springer
15 years 7 months ago
2006
Springer
Current research in the field of automatic plagiarism detection for text documents focuses on algorithms that compare plagiarized documents against potential original documents. Th...
159
click to vote
ATMOS
2007
15 years 7 months ago
2007
The Train Timetabling Problem (TTP) consists in finding a train schedule on a railway network that satisfies some operational constraints and maximizes a profit function which c...
167
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we investigate and compare multi-objective and weighted single objective approaches to a real world workforce scheduling problem. For this difficult problem we consid...
139
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Time plays an essential role in the diffusion of information, influence and disease over networks. In many cases we only observe when a node copies information, makes a decision ...