5889 search results - page 1087 / 1178 » Graph Layout Problems |
104
click to vote
FPGA
1995
ACM
15 years 1 months ago
1995
ACM
Routing FPGAs is a challenging problem because of the relative scarcity of routing resources, both wires and connection points. This can lead either to slow implementations caused...
LICS
1997
IEEE
15 years 1 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
109
click to vote
UIST
1995
ACM
15 years 1 months ago
1995
ACM
A fundamental issue in user interface design is the effective use of available screen space, commonly referred to as the screen real estate problem. This paper presents a new dist...
ICLP
1989
Springer
1989
Springer
Complete and Efficient Methods for Supporting Side-effects in Independent/Restricted AND-Parallelism
15 years 1 months ago
It has been shown that it is possible to exploit Independent/Restricted And-parallelism in logic programs while retaining the conventional "don't know" semantics of...
CCS
2010
ACM
15 years 1 months ago
2010
ACM
Recommender systems are used to predict user preferences for products or services. In order to seek better prediction techniques, data owners of recommender systems such as Netfli...