Sciweavers

1174 search results - page 57 / 235
» Derivation of Characteristic Formulae
Sort
View
ICTAI
2009
IEEE
15 years 10 months ago
Learning for Dynamic Assignments Reordering
In this paper a new learning scheme for SAT is proposed. The originality of our approach arises from its ability to achieve clause learning even if no conflict occurs. This clear...
Saïd Jabbour
ASPDAC
2009
ACM
135views Hardware» more  ASPDAC 2009»
15 years 10 months ago
Analysis of communication delay bounds for network on chips
—In network-on-chip, computing worst-case delay bound for packet delivery is crucial for designing predictable systems but yet an intractable problem due to complicated resource ...
Yue Qian, Zhonghai Lu, Wenhua Dou
IPPS
2003
IEEE
15 years 9 months ago
The Maximal Utilization of Processor Co-Allocation in Multicluster Systems
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...
Anca I. D. Bucur, Dick H. J. Epema
CP
2006
Springer
15 years 7 months ago
Generating Propagators for Finite Set Constraints
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
Guido Tack, Christian Schulte, Gert Smolka
LOGCOM
2008
97views more  LOGCOM 2008»
15 years 4 months ago
One-and-a-halfth-order Logic
The practice of first-order logic is replete with meta-level concepts. Most notably there are meta-variables ranging over formulae, variables, and terms, and properties of syntax s...
Murdoch James Gabbay, Aad Mathijssen