Sciweavers

244 search results - page 39 / 49
» Turing machines and bimachines
Sort
View
ACTA
2006
74views more  ACTA 2006»
13 years 7 months ago
Linearly bounded infinite graphs
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural family of canonical infinite automata representing their...
Arnaud Carayol, Antoine Meyer
CCS
2009
ACM
13 years 10 months ago
Filter-resistant code injection on ARM
Code injections attacks are one of the most powerful and important classes of attacks on software. In such attacks, the attacker sends malicious input to a software application, w...
Yves Younan, Pieter Philippaerts, Frank Piessens, ...
AI
2007
Springer
13 years 7 months ago
From here to human-level AI
It is not surprising that reaching human-level AI has proved to be difficult and progress has been slow— though there has been important progress. The slowness and the demand t...
John McCarthy
UML
2005
Springer
14 years 26 days ago
Enhancement of Development Technologies for Agent-Based Software Engineering
Abstract. Current trends in software development show a move towards supporting autonomous components (agents). The accurate timing of interactions between such components is growi...
Andre Karpistsenko
VLDB
2004
ACM
99views Database» more  VLDB 2004»
14 years 22 days ago
Query Languages and Data Models for Database Sequences and Data Streams
We study the fundamental limitations of relational algebra (RA) and SQL in supporting sequence and stream queries, and present effective query language and data model enrichments ...
Yan-Nei Law, Haixun Wang, Carlo Zaniolo