Abstract. The Boolean satisfiability problem (SAT) can be solved efficiently with variants of the DPLL algorithm. For industrial SAT problems, DPLL with conflict analysis depend...
Let R be the preorder of embeddability between countable linear orders colored with elements of Rado’s partial order (a standard example of a wqo which is not a bqo). We show tha...
Let Bi be deterministic real symmetric m × m matrices, and ξi be independent random scalars with zero mean and “of order of one” (e.g., ξi ∼ N(0, 1)). We are interested to...
We investigate the differences ? in terms of both quantitative performance and subjective preference ? between direct-touch and mouse input for unimanual and bimanual tasks on tab...
Clifton Forlines, Daniel Wigdor, Chia Shen, Ravin ...
This paper presents a multi-agent framework designed to simulate synthetic humans that properly balance task oriented and social behaviors. The work presented in this paper focuses...
Francisco Grimaldo, Miguel Lozano, Fernando Barber