We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...
Daesub Yoon, N. Hari Narayanan, SooCheol Lee, Oh-C...
Scientific community is showing a growing interest in Collaborative Systems, although most of developed systems deal with specific applications. This, together with the effort that...
Crescencio Bravo, Miguel A. Redondo, Manuel Ortega...
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the M...
Nuno P. Lopes, Levent Aksoy, Vasco M. Manquinho, J...