A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
J. Christopher Beck, Tom Carchrae, Eugene C. Freud...
Abstract. Artificial Intelligence techniques have been successfully applied to several computer games. However in some kinds of computer games, like real-time strategy (RTS) games...
— Opportunistic communication allows humans equipped with mobile devices to exchange information via a wireless link whenever they are nearby. This work examines the performance ...
In this paper, we propose a simple framework to characterize the switching behavior between search engines based on click streams. We segment users into a number of categories bas...
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...