Sciweavers

840 search results - page 7 / 168
» An Interactive Approach to Route Search
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
CEC
2007
IEEE
13 years 11 months ago
A Simulated Evolution-Tabu search hybrid metaheuristic for routing in computer networks
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
Salman A. Khan, Zubair A. Baig
EVOW
2009
Springer
14 years 2 months ago
Swarm Intelligence Inspired Multicast Routing: An Ant Colony Optimization Approach
Abstract. The advancement of network induces great demands on a series of applications such as the multicast routing. This paper firstly makes a brief review on the algorithms in ...
Xiaomin Hu, Jun Zhang, Li-Ming Zhang
JSW
2008
116views more  JSW 2008»
13 years 7 months ago
A Task-oriented Approach to Search Engine Usability Studies
Usability is a multi-dimensional characteristic of a computer system. This paper focuses on usability as a measurement of interaction between the user and the system. The research ...
Isak Taksa, Amanda Spink, Robert Goldberg
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
13 years 11 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin