Sciweavers

471 search results - page 82 / 95
» Computational complexity: a conceptual perspective
Sort
View
ICFP
1999
ACM
13 years 12 months ago
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract)
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Tur...
GG
2008
Springer
13 years 8 months ago
Transformation-Based Operationalization of Graph Languages
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
Erhard Weinell
SAC
2008
ACM
13 years 7 months ago
Towards self-configuration and management of e-service provisioning in dynamic value constellations
Networked value constellations are collections of enterprises that jointly satify complex consumer needs. Increasingly, such needs are satisfied by e-services, i.e. commercial ser...
Jaap Gordijn, Hans Weigand, Manfred Reichert, Roel...
ATAL
2009
Springer
14 years 2 months ago
Boolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
Piotr Faliszewski, Edith Elkind, Michael Wooldridg...
KI
2008
Springer
13 years 7 months ago
Shallow Models for Non-iterative Modal Logics
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Lutz Schröder, Dirk Pattinson