244 search results - page 48 / 49 » Analyzing the performance of randomized information sharing |
CP
2003
Springer
13 years 11 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
ISSTA
2010
ACM
13 years 7 months ago
2010
ACM
Writing reliable software is difficult. It becomes even more difficult when writing scientific software involving floating-point numbers. Computers provide numbers with limite...
JSAC
2008
13 years 5 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
SIGMETRICS
2010
ACM
13 years 10 months ago
2010
ACM
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
BMCBI
2010
13 years 5 months ago
2010
Background: Large-scale genomic studies often identify large gene lists, for example, the genes sharing the same expression patterns. The interpretation of these gene lists is gen...