1299 search results - page 230 / 260 » Computing Minimal Diagnoses with Critical Set Algorithms |
113
click to vote
IS
2011
14 years 1 months ago
2011
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
114
click to vote
KDD
2003
ACM
15 years 10 months ago
2003
ACM
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
SIGCOMM
1997
ACM
15 years 1 months ago
1997
ACM
—Byte stuffing is a process that encodes a sequence of data bytes that may contain ‘illegal’ or ‘reserved’ values, using a potentially longer sequence that contains no oc...
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
MOBISYS
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we present a reliable storage service, called SolarStore, that adaptively trades-off storage reliability versus energy consumption in solar-powered sensor networks....