Sciweavers

2629 search results - page 166 / 526
» complex 2009
Sort
View
115
Voted
SC
2009
ACM
15 years 7 months ago
FPGA-based acceleration of CHARMM-potential minimization
Energy minimization is an important step in molecular modeling, with applications in molecular docking and in mapping binding sites. Minimization involves repeated evaluation of v...
Bharat Sukhwani, Martin C. Herbordt
101
Voted
SI3D
2009
ACM
15 years 7 months ago
Fast high-quality line visibility
Lines drawn over or in place of shaded 3D models can often provide greater comprehensibility and stylistic freedom that shading alone. A substantial challenge for making stylized ...
Forrester Cole, Adam Finkelstein
111
Voted
STOC
2009
ACM
118views Algorithms» more  STOC 2009»
15 years 7 months ago
How long does it take to catch a wild kangaroo?
The discrete logarithm problem asks to solve for the exponent x, given the generator g of a cyclic group G and an element h ∈ G such that gx = h. We give the first rigorous pro...
Ravi Montenegro, Prasad Tetali
95
Voted
EVOW
2009
Springer
15 years 7 months ago
Binary Exponential Back Off for Tabu Tenure in Hyperheuristics
In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) ...
Stephen Remde, Keshav P. Dahal, Peter I. Cowling, ...
154
Voted
EVOW
2009
Springer
15 years 7 months ago
Discrete Particle Swarm Optimization for Multiple Destination Routing Problems
This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the tr...
Zhi-hui Zhan, Jun Zhang