3937 search results - page 226 / 788 » Questioning Ubiquitous Computing |
135
Voted
BIRTHDAY
2009
Springer
15 years 11 months ago
2009
Springer
We provide a new proof of a theorem of Saks which is an extension of Greene’s Theorem to acyclic digraphs, by reducing it to a similar, known extension of Greene and Kleitman’s...
139
click to vote
ICAC
2006
IEEE
15 years 10 months ago
2006
IEEE
— Systems should be self-predicting. They should continuously monitor themselves and provide quantitative answers to What...if questions about hypothetical workload or resource c...
102
Voted
CIE
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We discuss some known and introduce some new reducibilities on regular sets. We establish some facts on the corresponding degree structures and relate some reducibilities...
105
click to vote
ECOOPW
1999
Springer
15 years 8 months ago
1999
Springer
This paper reports the results of a workshop held at ECOOP’99. The workshop was set up to find answers to questions fundamental to the definition of a semantics for the Unifie...
128
click to vote
CHI
1993
ACM
15 years 8 months ago
1993
ACM
In order to inform the design of technology support and new procedural methodsfor softwaredesign,we analyzed the content of real design meetingsin threeorganizations, focusing in ...