3937 search results - page 354 / 788 » Questioning Ubiquitous Computing |
143
click to vote
FOCS
1996
IEEE
15 years 9 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
168
click to vote
DSVIS
1997
Springer
15 years 9 months ago
1997
Springer
The obvious advantages of prototyping and incremental development for interactive systems lead some people to believe that specifications of such systems are unnecessary or even ha...
111
click to vote
MFCS
1994
Springer
15 years 9 months ago
1994
Springer
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present re...
110
click to vote
WG
1992
Springer
15 years 9 months ago
1992
Springer
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
134
click to vote
CSR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...