Sciweavers

1686 search results - page 149 / 338
» Programs as polygraphs: computability and complexity
Sort
View
137
Voted
IJAOSE
2010
227views more  IJAOSE 2010»
15 years 2 months ago
Implementing reactive BDI agents with user-given constraints and objectives
CASO is an agent-oriented programming language based on AgentSpeak(L), one of the most influential abstract languages based on the BDI (Beliefs-Desires-Intentions) architecture. ...
Aniruddha Dasgupta, Aditya K. Ghose
123
Voted
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 3 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...
FPL
2007
Springer
94views Hardware» more  FPL 2007»
15 years 9 months ago
A Many-core Implementation based on the Reconfigurable Mesh Model
The reconfigurable mesh is a model for massively parallel computing for which many algorithms with very low complexity have been developed. These algorithms execute cycles of bus...
Heiner Giefers, Marco Platzner
125
Voted
DIS
2004
Springer
15 years 9 months ago
Privacy Problems with Anonymized Transaction Databases
In this paper we consider privacy problems with anonymized transaction databases, i.e., transaction databases where the items are renamed in order to hide sensitive information. In...
Taneli Mielikäinen
111
Voted
ITICSE
1997
ACM
15 years 7 months ago
Recursion and grammars for CS2
A programming exercise on recursion in which students create drawings of simple and bracketed Lindenmayer Systems provides a context for exploring additional computer science conc...
Viera K. Proulx