Sciweavers

923 search results - page 44 / 185
» On the Topology of Discrete Strategies
Sort
View
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
13 years 5 months ago
Parallel shared memory strategies for ant-based optimization algorithms
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
Thang Nguyen Bui, ThanhVu H. Nguyen, Joseph R. Riz...
ANLP
2000
124views more  ANLP 2000»
13 years 9 months ago
A Divide-and-Conquer Strategy for Shallow Parsing of German Free Texts
We present a divide-and-conquer strategy based on finite state technology for shallow parsing of realworld German texts. In a first phase only the topological structure of a sente...
Günter Neumann, Christian Braun, Jakub Piskor...
ISPA
2004
Springer
14 years 1 months ago
An Adaptive Routing Strategy Based on Dynamic Cache in Mobile Ad Hoc Networks
The dynamic changes of the topology caused by the movement of nodes makes routing become one of the key problems in the mobile Ad Hoc Networks (MANET). So how to optimize routing b...
YueQuan Chen, Xiaofeng Guo, QingKai Zeng, Guihai C...
CIS
2008
Springer
13 years 9 months ago
A Near-Optimal Redundancy Allocation Strategy that Minimizes a System's Vulnerability to Hazardous Events and Malicious Attacks
Delivering continuous services in information infrastructures is a major challenge. For system or network administrators, redundancy allocation is one of the best strategies to en...
Frank Yeong-Sung Lin, Po-Hao Tsang, Kun-Dao Jiang
IJHPCN
2006
151views more  IJHPCN 2006»
13 years 7 months ago
Adaptive local searching and caching strategies for on-demand routing protocols in ad hoc networks
: On-demand routing protocols are widely used in mobile ad hoc networks due to their capability of adjusting to frequent network topology changes within acceptable routing overhead...
Zhao Cheng, Wendi B. Heinzelman