Sciweavers

913 search results - page 140 / 183
» Full Abstraction for Linda
Sort
View
PLDI
2010
ACM
14 years 3 months ago
Finding low-utility data structures
Many opportunities for easy, big-win, program optimizations are missed by compilers. This is especially true in highly layered Java applications. Often at the heart of these misse...
Guoqing Xu, Nick Mitchell, Matthew Arnold, Atanas ...
INFOCOM
2002
IEEE
14 years 3 months ago
Optimizing the Topology of Bluetooth Wireless Personal Area Networks
Abstract— In this paper, we address the problem of determining an optimal topology for Bluetooth Wireless Personal Area Networks (BT-WPANs). In BT-WPANs, multiple communication c...
Marco Ajmone Marsan, Carla-Fabiana Chiasserini, An...
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
14 years 2 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
ESAW
2006
Springer
14 years 1 months ago
Using Constraints and Process Algebra for Specification of First-Class Agent Interaction Protocols
Abstract. Current approaches to multi-agent interaction involve specifying protocols as sets of possible interactions, and hard-coding decision mechanisms into agent programs in or...
Tim Miller, Peter McBurney
CIE
2008
Springer
14 years 2 days ago
Recursion on Nested Datatypes in Dependent Type Theory
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
Ralph Matthes