4103 search results - page 167 / 821 » Some results on the Collatz problem |
140
click to vote
AAAI
1994
15 years 8 months ago
1994
The paper evaluates the eectiveness of learning for speeding up the solution of constraint satisfaction problems. It extends previous work (Dechter 1990) by introducing a new and ...
184
click to vote
EOR
2008
15 years 6 months ago
2008
Recently, in the field of project scheduling problems the concept of partially renewable resources has been introduced. Theoretically, it is a generalization of both renewable and...
204
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...
175
click to vote
CP
2005
Springer
16 years 5 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...
157
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
This paper studies a general dynamic buffer management problem with one buffer inserted between two interacting components. The component to be controlled is assumed to have multi...