Sciweavers

2370 search results - page 411 / 474
» On the Revival of Dynamic Languages
Sort
View
ATAL
2008
Springer
15 years 2 months ago
Continual collaborative planning for mixed-initiative action and interaction
Multiagent environments are often highly dynamic and only partially observable which makes deliberative action planning computationally hard. In many such environments, however, a...
Michael Brenner
CASES
2008
ACM
15 years 2 months ago
Efficient code caching to improve performance and energy consumption for java applications
Java applications rely on Just-In-Time (JIT) compilers or adaptive compilers to generate and optimize binary code at runtime to boost performance. In conventional Java Virtual Mac...
Yu Sun, Wei Zhang
92
Voted
ICSE
2010
IEEE-ACM
15 years 2 months ago
Requirements reflection: requirements as runtime entities
Computational reflection is a well-established technique that gives a program the ability to dynamically observe and possibly modify its behaviour. To date, however, reflection is...
Nelly Bencomo, Jon Whittle, Peter Sawyer, Anthony ...
87
Voted
IWMM
2010
Springer
125views Hardware» more  IWMM 2010»
15 years 2 months ago
Efficient memory shadowing for 64-bit architectures
Shadow memory is used by dynamic program analysis tools to store metadata for tracking properties of application memory. The efficiency of mapping between application memory and s...
Qin Zhao, Derek Bruening, Saman P. Amarasinghe
103
Voted
COMPGEOM
2008
ACM
15 years 2 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...