6010 search results - page 802 / 1202 » Computational Approaches to Drug Design |
195
click to vote
CIKM
2007
Springer
16 years 1 months ago
2007
Springer
In this paper, we study the problem of effective keyword search over XML documents. We begin by introducing the notion of Valuable Lowest Common Ancestor (VLCA) to accurately and ...
176
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
This paper explores the application of the particle swarm algorithm for a NP-hard problem in the area of wireless communications. The specific problem is of detecting symbols in a...
174
click to vote
LCPC
2007
Springer
16 years 1 months ago
2007
Springer
The use of multiprocessor tasks (M-tasks) has been shown to be successful for mixed task and data parallel implementations of algorithms from scientific computing. The approach o...
250
click to vote
AI
1998
Springer
15 years 11 months ago
1998
Springer
A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. However, very few...
219
click to vote
FPL
2008
Springer
15 years 8 months ago
2008
Springer
Cryptanalysis of symmetric and asymmetric ciphers is a challenging task due to the enormous amount of involved computations. To tackle this computational complexity, usually the e...