672 search results - page 5 / 135 » A General Solution to the Graph History Interaction Problem |
79
Voted
WADS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
CHI
2004
ACM
15 years 10 months ago
2004
ACM
How much history of the dialogue should a chat client include? Some chat clients have minimized the dialogue history to deploy the space for other purposes. A theory of conversati...
76
Voted
DAM
1999
14 years 10 months ago
1999
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
97
Voted
HIS
2009
14 years 8 months ago
2009
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
WISE
2003
Springer
15 years 3 months ago
2003
Springer
There is much current interest in publishing and viewing databases as XML documents. The general benefits of this approach follow from the popularity of XML and the tool set avai...