Sciweavers

628 search results - page 124 / 126
» Approximation Algorithms for Quickest Spanning Tree Problems
Sort
View
88
Voted
AAAI
2010
14 years 11 months ago
Symbolic Dynamic Programming for First-order POMDPs
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
Scott Sanner, Kristian Kersting
IJCAI
2003
14 years 11 months ago
Employing Trainable String Similarity Metrics for Information Integration
The problem of identifying approximately duplicate objects in databases is an essential step for the information integration process. Most existing approaches have relied on gener...
Mikhail Bilenko, Raymond J. Mooney
COCOA
2009
Springer
15 years 2 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya
GECCO
2007
Springer
256views Optimization» more  GECCO 2007»
15 years 3 months ago
A particle swarm optimization approach for estimating parameter confidence regions
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
Praveen Koduru, Stephen Welch, Sanjoy Das
LCN
2006
IEEE
15 years 3 months ago
Protecting Multicast Sessions in Wireless Mesh Networks
To support reliable multicast routing in wireless mesh networks, it is important to protect multicast sessions against link or node failures. The issue of protecting multicast ses...
Xin Zhao, Chun Tung Chou, Jun Guo, Sanjay Jha