Sciweavers

1170 search results - page 6 / 234
» How Fast Is Too Fast
Sort
View
CEC
2005
IEEE
14 years 3 months ago
Enumerating knight's tours using an ant colony algorithm
In this paper we show how an ant colony optimisation algorithm may be used to enumerate knight’s tours for variously sized chessboards. We have used the algorithm to enumerate al...
Philip Hingston, Graham Kendall
ICCSA
2004
Springer
14 years 3 months ago
A Fast Handover Protocol for Mobile IPv6 Using Mobility Prediction Mechanism
Mobile IPv6 enables mobile node to roam transparently in any network. It shows good performance for macro mobility but it is not proper for supporting micro mobility because of lar...
Dae Sun Kim, Choong Seon Hong
SI3D
2009
ACM
14 years 4 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
RT
2000
Springer
14 years 1 months ago
Fast Global Illumination Including Specular Effects
Rapidly simulating global illumination, including diffuse and glossy light transport is a very difficult problem. Finite element or radiosity approaches can achieve interactive si...
Xavier Granier, George Drettakis, Bruce Walter
DATE
2002
IEEE
97views Hardware» more  DATE 2002»
14 years 2 months ago
Fast Method to Include Parasitic Coupling in Circuit Simulations
S-parameter based circuit simulators are used a lot for the design of microwave circuits. The accuracy of these simulators is limited by the fact that they do not take the electro...
B. L. A. Van Thielen, G. A. E. Vandenbosch