1686 search results - page 298 / 338 » Programs as polygraphs: computability and complexity |
103
click to vote
GLOBECOM
2008
IEEE
14 years 9 months ago
2008
IEEE
Abstract-- We study the problem of total throughput maximization in arbitrary multi-hop wireless networks, with constraints on the total power usage (denoted by PETM), when nodes h...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
JACM
2006
14 years 9 months ago
2006
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
MAGS
2008
14 years 9 months ago
2008
Process calculi are mathematical tools used for modeling and analyzing the structure and behavior of reactive systems. One such calculus, called APi-calculus (an extension to Pi-ca...
KI
2006
Springer
14 years 9 months ago
2006
Springer
This document describes the `Geo-Temporal' specification language GeTS. The objects which can be described and manipulated with this language are time points, crisp and fuzzy...