550 search results - page 56 / 110 » Context Semantics, Linear Logic and Computational Complexity |
ICPADS
1996
IEEE
15 years 1 months ago
1996
IEEE
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...
IOR
2007
14 years 9 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
HCI
2009
14 years 7 months ago
2009
Abstract. The P300 Speller has proven to be an effective paradigm for braincomputer interface (BCI) communication. Using this paradigm, studies have shown that a simple linear clas...
123
click to vote
DIMACS
1996
14 years 11 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
CCS
2007
ACM
15 years 4 months ago
2007
ACM
In defining large, complex access control policies, one would like to compose sub-policies, perhaps authored by different organizations, into a single global policy. Existing po...