1952 search results - page 280 / 391 » Complete partitions of graphs |
178
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
153
click to vote
MICRO
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper provides quantitative measurements of load latency tolerance in a dynamically scheduled processor. To determine the latency tolerance of each memory load operation, our...
180
click to vote
MP
1998
15 years 6 months ago
1998
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
168
click to vote
PPDP
2009
Springer
16 years 28 days ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
161
click to vote
IPPS
2006
IEEE
16 years 12 days ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...