16404 search results - page 2783 / 3281 » A set coverage problem |
158
click to vote
ENDM
2007
15 years 7 months ago
2007
For a given positive integer k, sr(m, k) denotes the minimal positive integer such that every coloring of [n], n ≥ sr(m, k), that uses each color at most k times, yields a rainb...
157
click to vote
ENTCS
2007
15 years 7 months ago
2007
We tackle the problem of data-structure rewriting including global and local pointer redirections. Each basic rewrite step may perform three kinds of actions: (i) Local redirectio...
163
click to vote
ENTCS
2007
15 years 7 months ago
2007
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...
195
click to vote
JSAC
2006
15 years 7 months ago
2006
Measuring the performance of an implementation of a set of protocols and analyzing the results is crucial to understanding the performance and limitations of the protocols in a rea...
184
click to vote
JSCIC
2006
15 years 7 months ago
2006
We improve upon a method introduced in (Bertalmio et. al. JCP 2001) for solving evolution PDEs on codimension-one surfaces in RN. As in the original method, by representing the su...