2681 search results - page 33 / 537 » Problem F |
CORR
2002
Springer
13 years 8 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
SBACPAD
2003
IEEE
14 years 2 months ago
2003
IEEE
— A radiative transfer solver that implements the LTSn method was optimized and parallelized using the MPI message passing communication library. Timing and profiling informatio...
STACS
2004
Springer
14 years 2 months ago
2004
Springer
d Abstract)⋆⋆ Daniel Kirsten LIAFA, Universit´e Denis Diderot – Case 7014, 2 place Jussieu, F-75251 Paris Cedex 05, France We give a positive solution to the so-called fini...
TPDS
2008
13 years 8 months ago
2008
We consider the Continuous Delivery Message Dissemination (CDMD) problem over the n-processor single-port complete (all links are present and are bidirectional) static network with...
COMBINATORICS
2006
13 years 9 months ago
2006
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must...