Sciweavers

7092 search results - page 553 / 1419
» Parallelizing constraint programs
Sort
View
SQJ
2010
112views more  SQJ 2010»
14 years 11 months ago
Improving design-pattern identification: a new approach and an exploratory study
The identification of occurrences of design patterns in programs can help maintainers to understand the program design and implementation. It can also help them to make informed ch...
Yann-Gaël Guéhéneuc, Jean-Yves ...
CADE
2001
Springer
16 years 5 months ago
A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities
The modalities of Dynamic Logic refer to the final state of a program execution and allow to specify programs with pre- and postconditions. In this paper, we extend Dynamic Logic w...
Bernhard Beckert, Steffen Schlager
AAAI
1996
15 years 6 months ago
Generating Multiple New Designs From a Sketch
We describe a program called SketchIT that transforms a single sketch of a mechanical device into multiple families of new designs. It represents each of these families with a &qu...
Thomas F. Stahovich, Randall Davis, Howard E. Shro...
DATE
2007
IEEE
71views Hardware» more  DATE 2007»
15 years 11 months ago
Task scheduling for reliable cache architectures of multiprocessor systems
This paper presents a task scheduling method for reliable cache architectures (RCAs) of multiprocessor systems. The RCAs dynamically switch their operation modes for reducing the ...
Makoto Sugihara, Tohru Ishihara, Kazuaki Murakami
CP
2003
Springer
15 years 10 months ago
Identifying Inconsistent CSPs by Relaxation
How do we identify inconsistent CSPs quickly? This paper presents relaxation as one possible method; showing how we can generate relaxed CSPs which are easier to prove inconsistent...
Tomas Eric Nordlander, Ken N. Brown, Derek H. Slee...