Sciweavers

2657 search results - page 277 / 532
» On the complexity of hierarchical problem solving
Sort
View
DIS
2009
Springer
15 years 10 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
189
Voted
BALT
2010
15 years 1 months ago
Bringing Domain Knowledge to Pattern Matching
Abstract. This paper addresses the pattern matching problem for model transformation languages. Despite being an NP-complete problem, the pattern matching can be solved efficiently...
Agris Sostaks
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
16 years 23 days ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
192
Voted
WABI
2009
Springer
155views Bioinformatics» more  WABI 2009»
16 years 1 months ago
A Markov Classification Model for Metabolic Pathways
Background: This paper considers the problem of identifying pathways through metabolic networks that relate to a specific biological response. Our proposed model, HME3M, first ide...
Timothy Hancock, Hiroshi Mamitsuka
ISW
2010
Springer
15 years 4 months ago
Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
Jonathan T. Trostle, Andy Parrish