In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
Abdelraouf Ishtaiwi, John Thornton, Anbulagan, Abd...
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
The Signal Recognition Particle Database (SRPDB) at http://psyche.uthct.edu/dbs/SRPDB/SRPDB.html and http://bio.lundberg.gu.se/dbs/SRPDB/SRPDB. html assists in the better understa...
In the presence of a heavy-tail noise distribution, regression becomes much more di cult. Traditional robust regression methods assume that the noise distribution is symmetric and...
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...