164 search results - page 9 / 33 » A Smallest Generalization Step Strategy |
CONSTRAINTS
2007
13 years 7 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
ATAL
2004
Springer
14 years 28 days ago
2004
Springer
We propose a context-logic style formalism, Timed Reasoning Logics (TRL), to describe resource-bounded reasoners who take time to derive consequences of their knowledge. The seman...
DSN
2008
IEEE
14 years 2 months ago
2008
IEEE
Quorums are a basic construct in solving many fundamental distributed computing problems. One of the known ways of making quorums scalable and efficient is by weakening their int...
SC
2003
ACM
14 years 23 days ago
2003
ACM
We investigate runtime strategies for data-intensive applications that involve generalized reductions on large, distributed datasets. Our set of strategies includes replicated fi...
CHI
2010
ACM
14 years 20 days ago
2010
ACM
This paper proposes a mobile application to facilitate the meeting of people in unmarked spaces. We report on the concept, aspects of the work-in-progress implementation and futur...