Sciweavers

82 search results - page 2 / 17
» Roundings Respecting Hard Constraints
Sort
View
CP
2010
Springer
13 years 4 months ago
Testing Expressibility Is Hard
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
Ross Willard
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
13 years 11 months ago
Alternative techniques to solve hard multi-objective optimization problems
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
Ricardo Landa Becerra, Carlos A. Coello Coello, Al...
AAAI
2006
13 years 7 months ago
Hard Constrained Semi-Markov Decision Processes
In multiple criteria Markov Decision Processes (MDP) where multiple costs are incurred at every decision point, current methods solve them by minimising the expected primary cost ...
Wai-Leong Yeow, Chen-Khong Tham, Wai-Choong Wong
RTSS
2009
IEEE
14 years 8 days ago
Adaptive Dynamic Power Management for Hard Real-Time Systems
Abstract—Power dissipation has constrained the performance boosting of modern computer systems in the past decade. Dynamic power management has been widely applied to change the ...
Kai Huang, Luca Santinelli, Jian-Jia Chen, Lothar ...
ECMDAFA
2005
Springer
236views Hardware» more  ECMDAFA 2005»
13 years 11 months ago
Model-Driven Architecture for Hard Real-Time Systems: From Platform Independent Models to Code
The model-driven software development for hard real-time systems promotes the usage of the platform independent model as major design artifact. It is used to develop the software l...
Sven Burmester, Holger Giese, Wilhelm Schäfer