Sciweavers

1174 search results - page 214 / 235
» Optimizing generics is easy!
Sort
View
106
Voted
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
16 years 2 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
134
Voted
MOBIHOC
2008
ACM
16 years 1 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
POPL
2010
ACM
15 years 11 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala
ICCAD
2003
IEEE
148views Hardware» more  ICCAD 2003»
15 years 10 months ago
The Compositional Far Side of Image Computation
Symbolic image computation is the most fundamental computation in BDD-based sequential system optimization and formal verification. In this paper, we explore the use of over-appr...
Chao Wang, Gary D. Hachtel, Fabio Somenzi
ATAL
2009
Springer
15 years 8 months ago
An analysis of feasible solutions for multi-issue negotiation involving nonlinear utility functions
This paper analyzes bilateral multi-issue negotiation between selfinterested agents. Specifically, we consider the case where issues are divisible, there are time constraints in ...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....