Sciweavers

500 search results - page 3 / 100
» Procedure Placement Using Temporal Ordering Information
Sort
View
CADE
2005
Springer
14 years 8 months ago
Deciding Monodic Fragments by Temporal Resolution
In this paper we study the decidability of various fragments of monodic first-order temporal logic by temporal resolution. We focus on two resolution calculi, namely, monodic tempo...
Ullrich Hustadt, Boris Konev, Renate A. Schmidt
IPPS
2006
IEEE
14 years 2 months ago
Placement and routing of Boolean functions in constrained FPGAs using a distributed genetic algorithm and local search
In this work we present a system for implementing the placement and routing stages in the FPGA cycle of design, into the physical design stage. We start with the ISCAS benchmarks,...
Manuel Rubio del Solar, Juan Manuel Sánchez...
ASPLOS
1998
ACM
14 years 24 days ago
Cache-Conscious Data Placement
As the gap between memory and processor speeds continues to widen, cache efficiency is an increasingly important component of processor performance. Compiler techniques have been...
Brad Calder, Chandra Krintz, Simmi John, Todd M. A...
EMNLP
2008
13 years 10 months ago
Jointly Combining Implicit Constraints Improves Temporal Ordering
Previous work on ordering events in text has typically focused on local pairwise decisions, ignoring globally inconsistent labels. However, temporal ordering is the type of domain...
Nathanael Chambers, Daniel Jurafsky
SC
2009
ACM
14 years 3 months ago
Scalable temporal order analysis for large scale debugging
We present a scalable temporal order analysis technique that supports debugging of large scale applications by classifying MPI tasks based on their logical program execution order...
Dong H. Ahn, Bronis R. de Supinski, Ignacio Laguna...