2925 search results - page 460 / 585 » Information Complexity of Online Problems |
121
click to vote
INFOCOM
1997
IEEE
15 years 8 months ago
1997
IEEE
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...
140
Voted
CP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
153
click to vote
AVSS
2006
IEEE
15 years 7 months ago
2006
IEEE
The success of any Bayesian particle filtering based tracker relies heavily on the ability of the likelihood function to discriminate between the state that fits the image well an...
113
click to vote
VLDB
2000
ACM
15 years 7 months ago
2000
ACM
This demonstration illustrates how a comprehensive database reconciliation tool can provide the ability to characterize data-quality and data-reconciliation issues in complex real...
134
click to vote
AAAI
2007
15 years 6 months ago
2007
Planning under uncertainty involves two distinct sources of uncertainty: uncertainty about the effects of actions and uncertainty about the current state of the world. The most wi...