Sciweavers

2917 search results - page 65 / 584
» Satisfying Interaction Constraints
Sort
View
SARA
2009
Springer
14 years 3 months ago
Integrating Constraint Models for Sequential and Partial-Order Planning
Classical planning deals with finding a (shortest) sequence of actions transferring the world from its initial state to a state satisfying the goal condition. Traditional planning...
Roman Barták, Daniel Toropila
SAT
2004
Springer
117views Hardware» more  SAT 2004»
14 years 2 months ago
A Random Constraint Satisfaction Problem That Seems Hard for DPLL
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
Harold S. Connamacher
DATE
2010
IEEE
153views Hardware» more  DATE 2010»
14 years 1 months ago
Energy-efficient task allocation and scheduling for multi-mode MPSoCs under lifetime reliability constraint
In this paper, we consider energy minimization for multiprocessor system-on-a-chip (MPSoC) under lifetime reliability constraint of the system, which has become a serious concern ...
Lin Huang, Qiang Xu
ICCAD
1994
IEEE
137views Hardware» more  ICCAD 1994»
14 years 29 days ago
Dynamic scheduling and synchronization synthesis of concurrent digital systems under system-level constraints
We present in this paper a novel control synthesis technique for system-level specifications that are better described as a set of concurrent synchronous descriptions, their synch...
Claudionor José Nunes Coelho Jr., Giovanni ...
ETFA
2006
IEEE
14 years 15 days ago
Non-Schedulability Conditions for Off-line Scheduling of Real-Time Systems Subject to Precedence and Strict Periodicity Constrai
Classical off-line approaches based on preemption such as RM (Rate Monotonic), DM (Deadline Monotonic), EDF (Earliest Deadline First), LLF (Least Laxity First), etc, give schedula...
Patrick Meumeu Yomsi, Yves Sorel