Sciweavers

4940 search results - page 261 / 988
» On the Complexity of Universal Programs
Sort
View
SC
1995
ACM
15 years 10 months ago
Index Array Flattening Through Program Transformation
This paper presents techniques for compiling loops with complex, indirect array accesses into loops whose array references have at most one level of indirection. The transformatio...
Raja Das, Paul Havlak, Joel H. Saltz, Ken Kennedy
AAAI
2007
15 years 9 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
USENIX
2000
15 years 8 months ago
Outwit: UNIX Tool-Based Programming Meets the Windows World
The ubiquity of Windows-based desktop environments has not been matched by a corresponding emergence of tools supporting the Unix tool composition paradigm. Outwit is a suite of t...
Diomidis Spinellis
DMS
2010
147views Multimedia» more  DMS 2010»
15 years 4 months ago
Towards Security-aware Program Visualization for Analyzing In-lined Reference Monitors
In-lined Reference Monitoring frameworks are an emerging technology for enforcing security policies over untrusted, mobile, binary code. However, formulating correct policy specifi...
Aditi Patwardhan, Kevin W. Hamlen, Kendra Cooper
SIGDIAL
2010
15 years 4 months ago
Sparse Approximate Dynamic Programming for Dialog Management
Spoken dialogue management strategy optimization by means of Reinforcement Learning (RL) is now part of the state of the art. Yet, there is still a clear mismatch between the comp...
Senthilkumar Chandramohan, Matthieu Geist, Olivier...