Sciweavers

4178 search results - page 250 / 836
» Similarity Patterns in Language
Sort
View
COCOON
1999
Springer
15 years 11 months ago
Distributionally-Hard Languages
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
Lance Fortnow, Aduri Pavan, Alan L. Selman
ICLP
1997
Springer
15 years 10 months ago
Parallel Evaluation Strategies for Functional Logic Languages
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...
Sergio Antoy, Rachid Echahed, Michael Hanus
ARTS
1997
Springer
15 years 10 months ago
The Verus Language: Representing Time Efficiently with BDDs
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
Sérgio Vale Aguiar Campos, Edmund M. Clarke
PATAT
2000
Springer
89views Education» more  PATAT 2000»
15 years 10 months ago
A Language for Specifying Complete Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a nu...
Luís Paulo Reis, Eugenio Oliveira
ECOOP
1995
Springer
15 years 10 months ago
Do Object-Oriented Languages Need Special Hardware Support?
Previous studies have shown that object-oriented programs have different execution characteristics than procedural programs, and that special object-oriented hardware can improve p...
Urs Hölzle, David Ungar