2434 search results - page 143 / 487 » Algorithmic Randomness of Closed Sets |
97
Voted
CCGRID
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper focuses on the scheduling of multiple-wavelength lightpaths and outlines an algorithm to provide increased simultaneous allocations of lightpaths on the Lambda-Grid. Se...
115
Voted
ICDCS
2009
IEEE
16 years 25 days ago
2009
IEEE
Autonomous routing algorithms, such as BGP, are intended to reach a globally consistent set of routes after nodes iteratively and independently collect, process, and share network...
144
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Suppose one has access to oracles generating samples from two unknown probability distributions p and q on some N-element set. How many samples does one need to test whet...
135
Voted
FCT
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
142
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
Systemic pathways-oriented approaches to analysis of metabolic networks are effective for small networks but are computationally infeasible for genome scale networks. Current comp...