Sciweavers

301 search results - page 51 / 61
» Optimal Route Based on Dynamic Programming for Road Networks
Sort
View
AAAI
2008
13 years 10 months ago
H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
Akshat Kumar, Adrian Petcu, Boi Faltings
ICC
2007
IEEE
14 years 2 months ago
Optical WDM Network Planning Using Heterogeneous Multi-granularity OXCs
Multigranular optical WDM network aims to reduce network cost by grouping multiple wavelengths and then switching those wavelengths together at waveband or fiber levels. To configu...
Hong-Hsu Yen, Frank Yeong-Sung Lin, Steven S. W. L...
TCS
2008
13 years 7 months ago
Optimizing deletion cost for secure multicast key management
Multicast and broadcast are efficient ways to deliver messages to a group of recipients in a network. Due to the growing security concerns in various applications, messages are oft...
Zhi-Zhong Chen, Ze Feng, Minming Li, F. Frances Ya...
GECCO
2007
Springer
178views Optimization» more  GECCO 2007»
14 years 1 months ago
Nonlinear dynamics modelling for controller evolution
The problem of how to acquire a model of a physical robot, which is fit for evolution of controllers that can subsequently be used to control that robot, is considered in the con...
Julian Togelius, Renzo De Nardi, Hugo Gravato Marq...
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
14 years 1 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz