2173 search results - page 222 / 435 » On the Values of Reducibility Candidates |
175
click to vote
CP
2005
Springer
16 years 4 days ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
164
click to vote
AIMSA
2004
Springer
16 years 8 hour ago
2004
Springer
Nowadays, many real problem in Artificial Intelligence can be modeled as constraint satisfaction problems (CSPs). A general rule in constraint satisfaction is to tackle the hardes...
128
click to vote
ISCAS
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper, we investigate a new generalized selection combining (GSC) technique and an adaptive rake combining scheme to save the power consumption of mobile rake receivers fo...
175
click to vote
MICRO
2003
IEEE
15 years 12 months ago
2003
IEEE
Many dynamic optimization and/or binary translation systems hold optimized/translated superblocks in a code cache. Conventional code caching systems suffer from overheads when con...
176
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...