Sciweavers

1719 search results - page 5 / 344
» Scheduling with soft constraints
Sort
View
AINA
2007
IEEE
14 years 2 months ago
A Flexible Scheduling Framework for Deeply Embedded Systems
— Typical embedded systems must perform rather complex control and communication tasks with severely restricted computing resources. Due to these contraints most systems are sing...
Karsten Walther, Jörg Nolte
FLAIRS
2003
13 years 10 months ago
Soft CLP (FD)
Over-constrained problems can be solved with the help of soft constraints. Weighted constraints are a typical representation of soft constraints used to minimize weights of unsati...
Hana Rudová
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 8 months ago
Hybrid tractability of soft constraint problems
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
Martin C. Cooper, Stanislav Zivný
CI
2004
85views more  CI 2004»
13 years 8 months ago
Soft Constraint Propagation and Solving in Constraint Handling Rules
Soft constraints are a generalization of classical constraints, which allow for the description of preferences rather than strict requirements. In soft constraints, constraints and...
Stefano Bistarelli, Thom W. Frühwirth, Michae...
VLSID
2009
IEEE
143views VLSI» more  VLSID 2009»
14 years 9 months ago
SACR: Scheduling-Aware Cache Reconfiguration for Real-Time Embedded Systems
Dynamic reconfiguration techniques are widely used for efficient system optimization. Dynamic cache reconfiguration is a promising approach for reducing energy consumption as well...
Weixun Wang, Prabhat Mishra, Ann Gordon-Ross