3663 search results - page 534 / 733 » Problems in the ontology of computer programs |
143
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
155
click to vote
EICS
2009
ACM
16 years 1 months ago
2009
ACM
This paper discusses the use of formal methods for analysing human-computer interaction. We focus on the mode confusion problem that arises whenever the user thinks that the syste...
171
click to vote
ICPP
2008
IEEE
16 years 1 months ago
2008
IEEE
—We address the recently recognized privatization problem in software transactional memory (STM) runtimes, and introduce the notion of partially visible reads (PVRs) to heuristic...
152
click to vote
ACSC
2007
IEEE
16 years 27 days ago
2007
IEEE
The standard layered drawing convention for trees in which the vertical placement of a node is given by its level in the tree and each node is centered between its children can le...
158
click to vote
IPPS
2007
IEEE
16 years 25 days ago
2007
IEEE
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...