2487 search results - page 166 / 498 » cases 2009 |
82
Voted
WEA
2009
Springer
15 years 7 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
127
Voted
CEC
2009
IEEE
15 years 7 months ago
2009
IEEE
— We propose a robot path planning method based on particle swarm optimization in an uncertain environment. We consider the case that a robot’s cognition to its environment is ...
102
Voted
CEC
2009
IEEE
15 years 7 months ago
2009
IEEE
— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...
118
Voted
COMPSAC
2009
IEEE
15 years 7 months ago
2009
IEEE
To-date, security analysis techniques focus on the explicit access to data, thereby neglecting information flows happening over covert channels. As a result, critical business so...
100
click to vote
CSO
2009
IEEE
15 years 7 months ago
2009
IEEE
When a paid price discount activity occurs, the decisionmaker must decide whether or not and when to pay the additional fees for preferential price in an online fashion. This prob...