426 search results - page 77 / 86 » Possibilistic Stable Model Computing |
PODS
1989
ACM
13 years 11 months ago
1989
ACM
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Recognition of signs in sentences requires a training
set constructed out of signs found in continuous sentences.
Currently, this is done manually, which is a tedious process.
I...
PPOPP
2009
ACM
14 years 8 months ago
2009
ACM
The efficient mapping of program parallelism to multi-core processors is highly dependent on the underlying architecture. This paper proposes a portable and automatic compiler-bas...
SAC
2009
ACM
14 years 2 months ago
2009
ACM
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...