892 search results - page 96 / 179 » An efficient terminal and model order reduction algorithm |
TON
2008
13 years 10 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
KDD
2004
ACM
14 years 10 months ago
2004
ACM
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
SIGMOD
2002
ACM
14 years 10 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
AIPS
2009
13 years 11 months ago
2009
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
AAAI
1994
13 years 11 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...