Sciweavers

3937 search results - page 226 / 788
» Questioning Ubiquitous Computing
Sort
View
BIRTHDAY
2009
Springer
16 years 1 months ago
On Path Partitions and Colourings in Digraphs
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...
Irith Ben-Arroyo Hartman
ICAC
2006
IEEE
16 years 17 days ago
Informed data distribution selection in a self-predicting storage system
— Systems should be self-predicting. They should continuously monitor themselves and provide quantitative answers to What...if questions about hypothetical workload or resource c...
Eno Thereska, Michael Abd-El-Malek, Jay J. Wylie, ...
CIE
2005
Springer
16 years 1 days ago
Some Reducibilities on Regular Sets
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...
Victor L. Selivanov
ECOOPW
1999
Springer
15 years 10 months ago
UML Semantics FAQ
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...
Stuart Kent, Andy Evans, Bernhard Rumpe
CHI
1993
ACM
15 years 10 months ago
Preserving knowledge in design projects: what designers need to know
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 ...
James D. Herbsleb, Eiji Kuwana