Sciweavers

6167 search results - page 1202 / 1234
» Can Refinement be Automated
Sort
View
CP
2006
Springer
14 years 1 months ago
Boosting Open CSPs
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
Santiago Macho González, Carlos Ansó...
ESCIENCE
2006
IEEE
14 years 1 months ago
ODIN: A Model for Adapting and Enriching Legacy Infrastructure
The Online Database of Interlinear Text (ODIN)1 is a database of interlinear text "snippets", harvested mostly from scholarly documents posted to the Web. Although large...
William D. Lewis
FPGA
2000
ACM
177views FPGA» more  FPGA 2000»
14 years 1 months ago
Automatic generation of FPGA routing architectures from high-level descriptions
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...
Vaughn Betz, Jonathan Rose
ICSE
2000
IEEE-ACM
14 years 1 months ago
Little-JIL/Juliette: a process definition language and interpreter
Little-JIL, a language for programming coordination in processes is an executable, high-level language with a formal (yet graphical) syntax and rigorously defined operational seTh...
Aaron G. Cass, Barbara Staudt Lerner, Stanley M. S...
BIRTHDAY
1991
Springer
14 years 1 months ago
The Markgraf Karl Refutation Procedure
The goal of the MKRP project is the development of a theorem prover which can be used as an inference engine in various applications, in particular it should be capable of proving ...
Hans Jürgen Ohlbach, Jörg H. Siekmann
« Prev « First page 1202 / 1234 Last » Next »