4674 search results - page 529 / 935 » cases 2008 |
191
click to vote
EJC
2008
15 years 7 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
194
click to vote
EL
2008
15 years 7 months ago
2008
Purpose: Examines the needs of digital library stakeholders and how a collaborative digital library might be designed to meet these needs. The collaborative digital library has be...
208
click to vote
ENDM
2008
15 years 7 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
194
click to vote
ENGL
2008
15 years 7 months ago
2008
This paper investigates how expansion and compression of the surface of a drop containing an organic compound, 1-octanol, affect surface tension. The experiments were performed in...
192
click to vote
ENTCS
2008
15 years 6 months ago
2008
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...