- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
Following a number of recent papers investigating the possibility of optimal comparison-based optimization algorithms for a given distribution of probability on fitness functions...
Service-Oriented Architecture (SOA) is a system architecture in which a collection of loosely coupled services communicate with each other using standard interfaces and message-ex...
This paper presents and discusses the use of an agent-oriented context-aware platform to support communities of practice (CoPs) in the health care domain. Our work is based on a s...
Luiz Olavo Bonino da Silva Santos, Renata S. S. Gu...
This paper describes an intelligent tutoring system, LARGO, that helps students learn skills of legal reasoning with hypotheticals by analyzing oral arguments before the US Suprem...
Kevin D. Ashley, Niels Pinkwart, Collin Lynch, Vin...