4926 search results - page 178 / 986 » Two Graph Algorithms On an Associative Computing Model |
173
click to vote
BIRTHDAY
2010
Springer
15 years 6 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
185
Voted
ISPAN
2002
IEEE
15 years 10 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
161
Voted
CONCUR
2006
Springer
15 years 8 months ago
2006
Springer
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
119
Voted
EMNLP
2008
15 years 6 months ago
2008
The graph-based ranking algorithm has been recently exploited for multi-document summarization by making only use of the sentence-to-sentence relationships in the documents, under...
180
click to vote
COR
2008
15 years 4 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...