299 search results - page 44 / 60 » DNA Computing for Complex Scheduling Problem |
NOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
Many DSP algorithms are very computationally intensive. They are typically implemented using an ensemble of processing elements (PEs) operating in parallel. The results from PEs n...
ACSC
2007
IEEE
15 years 6 months ago
2007
IEEE
As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much wor...
100
click to vote
HICSS
2003
IEEE
15 years 5 months ago
2003
IEEE
A field study of Computer Mediated Communication (CMC) as used in higher education asks the questions, "Will students take part in synchronous chat sessions if they are sched...
104
click to vote
AAAI
2000
15 years 1 months ago
2000
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
SACMAT
2004
ACM
15 years 5 months ago
2004
ACM
In the era of Ubiquitous Computing and world–wide data transfer mobility, as an innovative aspect of professional activities, imposes new and complex problems of mobile and dist...