Sciweavers

1700 search results - page 340 / 340
» Specifying and implementing refactorings
Sort
View
POPL
2012
ACM
12 years 14 days ago
Programming with binders and indexed data-types
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
Andrew Cave, Brigitte Pientka
VEE
2012
ACM
234views Virtualization» more  VEE 2012»
12 years 13 days ago
REEact: a customizable virtual execution manager for multicore platforms
With the shift to many-core chip multiprocessors (CMPs), a critical issue is how to effectively coordinate and manage the execution of applications and hardware resources to overc...
Wei Wang, Tanima Dey, Ryan W. Moore, Mahmut Aktaso...
AIIDE
2008
13 years 7 months ago
Dynamic Expansion of Behaviour Trees
Artificial intelligence in games is typically used for creating player's opponents. Manual edition of intelligent behaviors for Non-Player Characters (NPCs) of games is a cum...
Gonzalo Flórez Puga, Marco Antonio Gó...
ICDE
2008
IEEE
193views Database» more  ICDE 2008»
14 years 6 months ago
DescribeX: Interacting with AxPRE Summaries
DescribeX is a visual, interactive tool for exploring the underlying structure of an XML collection. DescribeX implements a framework for creating XML summaries described using axi...
Mir Sadek Ali, Mariano P. Consens, Shahan Khatchad...
SIAMCOMP
2008
124views more  SIAMCOMP 2008»
13 years 4 months ago
A Faster, Better Approximation Algorithm for the Minimum Latency Problem
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Aaron Archer, Asaf Levin, David P. Williamson