41 search results - page 7 / 9 » A Language for Specifying Complete Timetabling Problems |
PLDI
2004
ACM
14 years 24 days ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
FPGA
2000
ACM
13 years 11 months ago
2000
ACM
In this paper we present a "high-level" FPGA architecture description language which lets FPGA architects succinctly and quickly describe an FPGA routing architecture. W...
CHARME
2003
Springer
14 years 18 days ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
BMCBI
2006
13 years 7 months ago
2006
Background: Biological databases and pathway knowledgebases are proliferating rapidly. We are developing software tools for computer-aided hypothesis design and evaluation, and we...