3446 search results - page 274 / 690 » A Reasoning Algorithm for pD* |
172
click to vote
KR
2004
Springer
15 years 12 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
171
click to vote
ECCV
2010
Springer
15 years 12 months ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
208
click to vote
DIALM
2000
ACM
15 years 11 months ago
2000
ACM
The allocation of scarce spectral resources to support as many user applications as possible while maintaining reasonable quality of service is a fundamental problem in wireless c...
156
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
We propose new techniques for efficient breadth-first iterative manipulation of ROBDDs. Breadth-first iterative ROBDD manipulation can potentially reduce the total elapsed time by...
179
click to vote
PODS
1990
ACM
15 years 10 months ago
1990
ACM
- Performancestudiesof concurrencycontrol algorithms for conventional database systems have shown that, under most operating circumstances, locking protocols outperform optimistic ...