1046 search results - page 40 / 210 » Approximation Algorithms for Domination Search |
127
click to vote
CP
2008
Springer
15 years 2 months ago
2008
Springer
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
106
Voted
IAT
2006
IEEE
15 years 6 months ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
130
click to vote
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
89
Voted
SWAT
1994
Springer
15 years 4 months ago
1994
Springer
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...