Sciweavers

8196 search results - page 63 / 1640
» Computational Modeling and Complexity Science
Sort
View
DIS
2009
Springer
15 years 1 months ago
Discovering Influential Nodes for SIS Models in Social Networks
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...
Kazumi Saito, Masahiro Kimura, Hiroshi Motoda
DILS
2010
Springer
14 years 11 months ago
On Matching Large Life Science Ontologies in Parallel
Matching life science ontologies to determine ontology mappings has recently become an active field of research. The large size of existing ontologies and the application of comple...
Anika Gross, Michael Hartung, Toralf Kirsten, Erha...
FOCS
1991
IEEE
15 years 1 months ago
Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
Anna Gál
FUIN
2007
134views more  FUIN 2007»
14 years 9 months ago
Complexity Issues in Multiagent Logics
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...
Marcin Dziubinski, Rineke Verbrugge, Barbara Dunin...