2827 search results - page 379 / 566 » Robustness of PSPACE-complete sets |
234
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
133
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
Whenever rational agents form coalitions to execute tasks, doing so via a decentralized negotiation process—while more robust and democratic—may lead to a loss of efficiency ...
136
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
144
Voted
SDM
2010
SIAM
15 years 5 months ago
2010
SIAM
The problem of missing data is ubiquitous in domains such as biomedical signal processing, network traffic analysis, bibliometrics, social network analysis, chemometrics, computer...
129
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: Analyzing interaction networks for functional characterization poses significant challenges arising from the noisy, incomplete, and generic nature of both the interact...