566 search results - page 45 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
101
Voted
IJMC
2006
15 years 14 days ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
PLDI
1999
ACM
15 years 4 months ago
1999
ACM
Load-reuse analysis finds instructions that repeatedly access the same memory location. This location can be promoted to a register, eliminating redundant loads by reusing the re...
100
Voted
ECAI
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
118
click to vote
CPAIOR
2008
Springer
15 years 2 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
96
Voted
AIR
1999
15 years 4 days ago
1999
The timetabling problem consists in scheduling a sequence of lectures between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints...