Sciweavers

526 search results - page 97 / 106
» Generalized benchmark generation for dynamic combinatorial p...
Sort
View
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 10 months ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
15 years 9 months ago
Mission planning for joint suppression of enemy air defenses using a genetic algorithm
In this paper we present a genetic algorithm applied to the problem of mission planning for Joint Suppression of Enemy Air Defenses (JSEAD) in support of air strike operations. Th...
Jeffrey P. Ridder, Jason C. HandUber
RTAS
1999
IEEE
15 years 8 months ago
Timing Constraint Remapping to Avoid Time Discontinuities in Distributed Real-Time Systems
In this paper we propose a dynamic constraint transformation technique for ensuring timing requirements in a distributed real-time system possessing periodically synchronized dist...
Minsoo Ryu, Jungkeun Park, Seongsoo Hong
CORR
2011
Springer
217views Education» more  CORR 2011»
14 years 7 months ago
Interactive Execution Monitoring of Agent Teams
There is an increasing need for automated support for humans monitoring the activity of distributed teams of cooperating agents, both human and machine. We characterize the domain...
Pauline Berry, Thomas J. Lee, David E. Wilkins
225
Voted
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
16 years 4 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...