Sciweavers

246 search results - page 25 / 50
» Dynamic Local Search for the Maximum Clique Problem
Sort
View
CEC
2009
IEEE
15 years 4 months ago
Evolutionary programming with ensemble of explicit memories for dynamic optimization
—This paper presents the evolutionary programming with an ensemble of memories to deal with optimization problems in dynamic environments. The proposed algorithm modifies a recen...
Ling Yu, Ponnuthurai N. Suganthan
ECAI
2010
Springer
14 years 9 months ago
Variable Level-Of-Detail Motion Planning in Environments with Poorly Predictable Bodies
Motion planning in dynamic environments consists of the generation of a collision-free trajectory from an initial to a goal state. When the environment contains uncertainty, preven...
Stefan Zickler, Manuela M. Veloso
SIAMNUM
2011
102views more  SIAMNUM 2011»
14 years 13 days ago
Differential Equations for Roaming Pseudospectra: Paths to Extremal Points and Boundary Tracking
Abstract. When studying the ε-pseudospectrum of a matrix, one is often interested in computing the extremal points having maximum real part or modulus. This is a crucial step, for...
Nicola Guglielmi, Christian Lubich
79
Voted
GPC
2007
Springer
15 years 3 months ago
Optimizing Server Placement for QoS Requirements in Hierarchical Grid Environments
This paper focuses on two problems related to QoS-aware I/O server placement in hierarchical Grid environments. Given a hierarchical network with requests from clients, the network...
Chien-Min Wang, Chun-Chen Hsu, Pangfeng Liu, Hsi-M...
PIMRC
2008
IEEE
15 years 4 months ago
Dynamic data aggregation and transport in wireless sensor networks
—In wireless sensor networks, in-network aggregation is the process of compressing locally the data gathered by the sensor nodes, so that only the compressed data travel across s...
Mario O. Diaz, Kin K. Leung