Sciweavers

1052 search results - page 207 / 211
» The Regular Real-Time Languages
Sort
View
CP
2003
Springer
14 years 19 days ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
SIGIR
1998
ACM
13 years 11 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
TLCA
1997
Springer
13 years 11 months ago
Coinductive Axiomatization of Recursive Type Equality and Subtyping
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
Michael Brandt, Fritz Henglein
CASES
2001
ACM
13 years 11 months ago
Transparent data-memory organizations for digital signal processors
Today's digital signal processors (DSPs), unlike general-purpose processors, use a non-uniform addressing model in which the primary components of the memory system--the DRAM...
Sadagopan Srinivasan, Vinodh Cuppu, Bruce L. Jacob
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
13 years 9 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou