6833 search results - page 126 / 1367 » Some two-character sets |
137
click to vote
AIL
2008
15 years 4 months ago
2008
This paper provides a computational framework, based on Defeasible Logic, to capture some aspects of institutional agency. Our background is Kanger-Lindahl-P
134
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
—The Berman-Hartmanis conjecture states that all NP-complete sets are P-isomorphic each other. On this conjecture, we first improve the result of [3] and show that all NP-comple...
133
click to vote
LPNMR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
126
click to vote
P2P
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper some representative peer-to-peer file sharing applications are compared against two sets of features. The first set describes the semantics of the relevant primiti...
160
click to vote
GC
2007
Springer
15 years 4 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...