Sciweavers

1046 search results - page 40 / 210
» Approximation Algorithms for Domination Search
Sort
View
CP
2008
Springer
13 years 10 months ago
Approximate Solution Sampling (and Counting) on AND/OR Spaces
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...
Vibhav Gogate, Rina Dechter
ATAL
2009
Springer
14 years 3 months ago
Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs
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...
Jilles Steeve Dibangoye, Abdel-Illah Mouaddib, Bra...
IAT
2006
IEEE
14 years 2 months ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
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...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...
ICDE
2009
IEEE
216views Database» more  ICDE 2009»
13 years 6 months ago
Continuous Subgraph Pattern Search over Graph Streams
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...
Changliang Wang, Lei Chen 0002
SWAT
1994
Springer
126views Algorithms» more  SWAT 1994»
14 years 17 days ago
Optimal Parametric Search on Graphs of Bounded Tree-Width
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...
David Fernández-Baca, Giora Slutzki