5180 search results - page 225 / 1036 » Concurrency, Time, and Constraints |
183
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we study a sequential decision making problem. The objective is to maximize the total reward while satisfying constraints, which are defined at every time step. The...
148
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Bounding constraints are used to bound the tolerance of solutions under certain undesirable features. Standard solvers propagate them one by one. Often times, it is easy to satisfy...
188
click to vote
VLDB
2000
ACM
15 years 10 months ago
2000
ACM
Interesting patterns often occur at varied levels of support. The classic association mining based on a uniform minimum support, such as Apriori, either misses interesting pattern...
299
click to vote
ICDT
1995
ACM
15 years 10 months ago
1995
ACM
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...
142
click to vote
IJCAI
2001
15 years 8 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...