Sciweavers

3653 search results - page 495 / 731
» On Recognizable Timed Languages
Sort
View
CSCLP
2006
Springer
15 years 10 months ago
Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
Marc Meister, Khalil Djelloul, Thom W. Frühwi...
FPL
2006
Springer
208views Hardware» more  FPL 2006»
15 years 10 months ago
Implementation in Fpgas of Jacobi Method to Solve the Eigenvalue and Eigenvector Problem
This work shows a modular architecture based on FPGA's to solve the eigenvalue problem according to the Jacobi method. This method is able to solve the eigenvalues and eigenv...
Ignacio Bravo, Pedro Jiménez, Manuel Mazo, ...
AICCSA
2001
IEEE
112views Hardware» more  AICCSA 2001»
15 years 10 months ago
Implementation of DDARC: Software Architecture for Debugging Distributed Programs
Debugging and testing is a larger part of the effort spent in a software development cycle. Debugging a program is time consuming and is a continuous cycle of code modification an...
Sushma Rai, D. Sampath, Srivathsa N. S.
ASP
2001
Springer
15 years 10 months ago
Effect of knowledge representation on model based planning: experiments using logic programming encodings
In this paper we implement planning using answer set programming. We consider the action language A and its extensions. We show that when the domain is described using richer feat...
Le-Chi Tuan, Chitta Baral
SAS
1997
Springer
111views Formal Methods» more  SAS 1997»
15 years 10 months ago
Fast and Effective Procedure Inlining
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
Oscar Waddell, R. Kent Dybvig