Sciweavers

64 search results - page 3 / 13
» New Dynamic Heuristics in the Client-Agent-Server Model
Sort
View
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
13 years 9 months ago
Indirect co-evolution for understanding belief in an incomplete information dynamic game
This study aims to design a new co-evolution algorithm, Mixture Co-evolution which enables modeling of integration and composition of direct co-evolution and indirect coevolution....
Nanlin Jin
PEPM
2009
ACM
14 years 2 months ago
Guided model checking for programs with polymorphism
Exhaustive model checking search techniques are ineffective for error discovery in large and complex multi-threaded software systems. Distance estimate heuristics guide the concre...
Neha Rungta, Eric G. Mercer
IJCSA
2007
110views more  IJCSA 2007»
13 years 5 months ago
Multiprocessor Scheduling Using Hybrid Particle Swarm Optimization with Dynamically Varying Inertia
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
S. N. Sivanandam, P. Visalakshi, A. Bhuvaneswari
DCOSS
2008
Springer
13 years 7 months ago
Frugal Sensor Assignment
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match...
Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro...
AUSAI
2004
Springer
13 years 10 months ago
A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
Songshan Guo, Ying Kong, Andrew Lim, Fan Wang