Sciweavers

13917 search results - page 2634 / 2784
» Abstraction of Probabilistic Systems
Sort
View
ICTAC
2004
Springer
16 years 11 days ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
LCTRTS
2004
Springer
16 years 11 days ago
Feedback driven instruction-set extension
Application specific instruction-set processors combine an efficient general purpose core with special purpose functionality that is tailored to a particular application domain. ...
Uwe Kastens, Dinh Khoi Le, Adrian Slowik, Michael ...
MFCS
2004
Springer
16 years 11 days ago
Captive Cellular Automata
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
Guillaume Theyssier
OOPSLA
2004
Springer
16 years 11 days ago
Modeling event driven applications with a specification language (MEDASL)
Radio Frequency Identification (RFID) technology provides the means to track any object, any time, anywhere with Electronic Product Codes (EPC). A major consequence of this techno...
Murali Kaundinya, Ali Syed
WCW
2004
Springer
16 years 10 days ago
An Empirical Study of a Segment-Based Streaming Proxy in an Enterprise Environment
Abstract. Streaming media workloads have a number of desirable properties that make them good candidates for caching via proxy systems. The content does not get modified, and acce...
Sumit Roy, Bo Shen, Songqing Chen, Xiaodong Zhang
« Prev « First page 2634 / 2784 Last » Next »