7129 search results - page 988 / 1426 » Approximation Algorithms for Treewidth |
109
click to vote
PAKDD
2010
ACM
15 years 9 months ago
2010
ACM
In this work, we investigate the use of online or “crawling” algorithms to sample large social networks in order to determine the most influential or important individuals wit...
138
click to vote
HM
2009
Springer
15 years 9 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
143
click to vote
ICDCN
2009
Springer
15 years 9 months ago
2009
Springer
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
124
click to vote
CONCUR
2001
Springer
15 years 9 months ago
2001
Springer
In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produ...
127
click to vote
ILP
2001
Springer
15 years 9 months ago
2001
Springer
The Bayesian framework of learning from positive noise-free examples derived by Muggleton [12] is extended to learning functional hypotheses from positive examples containing norma...