Sciweavers

36 search results - page 1 / 8
» Dynamic Time-Linkage Problems Revisited
Sort
View
EVOW
2009
Springer
13 years 11 months ago
Dynamic Time-Linkage Problems Revisited
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
Trung Thanh Nguyen, Xin Yao
EVOW
2009
Springer
13 years 2 months ago
The Dynamic Knapsack Problem Revisited: A New Benchmark Problem for Dynamic Combinatorial Optimisation
Abstract. In this paper we propose a new benchmark problem for dynamic combinatorial optimisation. Unlike most previous benchmarks, we focus primarily on the underlying dynamics of...
Philipp Rohlfshagen, Xin Yao
CDC
2010
IEEE
103views Control Systems» more  CDC 2010»
12 years 11 months ago
Integrator forwarding via dynamic scaling
The problem of integrator forwarding is revisited using the notion of dynamically scaled (control) Lyapunov function. A new class of dynamic stabilizing control laws is presented, ...
Laurent Praly, Daniele Carnevale, Alessandro Astol...
IOR
2008
105views more  IOR 2008»
13 years 4 months ago
The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing
The stochastic knapsack has been used as a model in wide ranging applications from dynamic resource allocation to admission control in telecommunication. In recent years, a variat...
Grace Y. Lin, Yingdong Lu, David D. Yao
CEC
2010
IEEE
12 years 8 months ago
Revisiting Evolutionary Information Filtering
— Adaptive Information Filtering seeks a solution to the problem of information overload through a tailored representation of the user’s interests, called user profile, which ...
Nikolaos Nanas, Stefanos Kodovas, Manolis Vavalis