Sciweavers

1380 search results - page 34 / 276
» Computing the optimal strategy to commit to
Sort
View
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 6 months ago
A Stackelberg Strategy for Routing Flow over Time
Routing games are used to to understand the impact of individual users’ decisions on network efficiency. Most prior work on routing games uses a simplified model of network fl...
Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich
ICSOC
2009
Springer
13 years 5 months ago
A Genetic Algorithms-Based Approach for Optimized Self-protection in a Pervasive Service Middleware
With increasingly complex and heterogeneous systems in pervasive service computing, it becomes more and more important to provide self-protected services to end users. In order to ...
Weishan Zhang, Julian Schütte, Mads Ingstrup,...
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...
IJCAI
1993
13 years 9 months ago
Evolutionary Learning Strategy using Bug-Based Search
We introduce a new approach to GA (Genetic Algorithms) based problem solving. Earlier GAs did not contain local search (i.e. hill climbing) mechanisms, which led to optimization d...
Hitoshi Iba, Tetsuya Higuchi, Hugo de Garis, Taisu...
ISMB
1998
13 years 9 months ago
Compression of Strings with Approximate Repeats
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
Lloyd Allison, Timothy Edgoose, Trevor I. Dix