Sciweavers

660 search results - page 127 / 132
» The Implicit Calculus of Constructions
Sort
View
SENSYS
2006
ACM
14 years 1 months ago
Scalable data aggregation for dynamic events in sensor networks
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
Kai-Wei Fan, Sha Liu, Prasun Sinha
ICSM
2005
IEEE
14 years 1 months ago
Context-Free Slicing of UML Class Models
In the work presented here, we introduce a method to automatically generate a subset of a UML class model based on a user-defined criterion. The goal of this work is to allow us to...
Huzefa H. Kagdi, Jonathan I. Maletic, Andrew Sutto...
IPPS
2005
IEEE
14 years 1 months ago
Automatic Support for Irregular Computations in a High-Level Language
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
Jimmy Su, Katherine A. Yelick
KBSE
2005
IEEE
14 years 1 months ago
An analysis of rule coverage as a criterion in generating minimal test suites for grammar-based software
The term grammar-based software describes software whose input can be specified by a context-free grammar. This grammar may occur explicitly in the software, in the form of an in...
Mark Hennessy, James F. Power
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
14 years 1 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...