285
Voted
ATC
15 years 11 months ago
2006 Springer 
In recent years, a variety of new computing paradigms have been proposed for various purposes. It is true that many of them intend to and really can gratify some of the people some...
299
Voted
ICICIC
16 years 1 months ago
2006 IEEE
In timetable scheduling problems, examination subjects must be slotted to certain times that satisfy several of constraints. They are NP-completeness problems, which usually lead ...
221
click to vote
ICICIC
16 years 1 months 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...
252
Voted
EUC
15 years 11 months ago
2006 Springer
In mobile ad hoc networks, mobile devices wander autonomously for the use of wireless links and dynamically varying network topology. AODV (Ad-hoc on-demand Distance vector routing...
|
Applied Computing