Sciweavers

8647 search results - page 1581 / 1730
» The Container Selection Problem
Sort
View
ICALP
1997
Springer
15 years 7 months ago
Recursive Computational Depth
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...
James I. Lathrop, Jack H. Lutz
PODC
1994
ACM
15 years 7 months ago
Using Belief to Reason about Cache Coherence
The notion of belief has been useful in reasoning about authentication protocols. In this paper, we show how the notion of belief can be applied to reasoning about cache coherence...
Lily B. Mummert, Jeannette M. Wing, Mahadev Satyan...
ELPUB
2007
ACM
15 years 7 months ago
Automatic Sentiment Analysis in On-line Text
The growing stream of content placed on the Web provides a huge collection of textual resources. People share their experiences on-line, ventilate their opinions (and frustrations...
Erik Boiy, Pieter Hens, Koen Deschacht, Marie-Fran...
ICDCS
2010
IEEE
15 years 7 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
ICLP
2010
Springer
15 years 7 months ago
Tight Semantics for Logic Programs
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
Luís Moniz Pereira, Alexandre Miguel Pinto
« Prev « First page 1581 / 1730 Last » Next »