Sciweavers

1071 search results - page 50 / 215
» Programming with enumerable sets of structures
Sort
View
ICLP
2004
Springer
14 years 4 months ago
On Programs with Linearly Ordered Multiple Preferences
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
PLDI
2010
ACM
14 years 4 months ago
Supporting speculative parallelization in the presence of dynamic data structures
The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative s...
Chen Tian, Min Feng, Rajiv Gupta
FPL
2001
Springer
115views Hardware» more  FPL 2001»
14 years 3 months ago
Placing, Routing, and Editing Virtual FPGAs
This paper presents the benefits of using a generic FPGA tool set developed at the university of Brest for programming virtual FPGA structures. From a high level FPGA description,...
Loïc Lagadec, Dominique Lavenier, Erwan Fabia...
DCC
2007
IEEE
14 years 10 months ago
Algorithms and Hardware Structures for Unobtrusive Real-Time Compression of Instruction and Data Address Traces
Instruction and data address traces are widely used by computer designers for quantitative evaluations of new architectures and workload characterization, as well as by software de...
Milena Milenkovic, Aleksandar Milenkovic, Martin B...
SIGSOFT
2005
ACM
14 years 11 months ago
Automatic generation of suggestions for program investigation
Before performing a modification task, a developer usually has to investigate the source code of a system to understand how to carry out the task. Discovering the code relevant to...
Martin P. Robillard