2796 search results - page 539 / 560 » The coolest path problem |
110
click to vote
ALGORITHMICA
2007
14 years 12 months ago
2007
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
BMCBI
2010
14 years 12 months ago
2010
Background: Many complementary solutions are available for the identifier mapping problem. This creates an opportunity for bioinformatics tool developers. Tools can be made to fle...
EOR
2008
14 years 12 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
TC
2008
14 years 11 months ago
2008
On-chip networks (OCNs) have been proposed to solve the increasing scale and complexity of the designs in nanoscale multicore VLSI designs. The concept of irregular meshes is an im...
102
click to vote
DAC
1997
ACM
15 years 4 months ago
1997
ACM
This paper examines the problem of statically analyzing the performance of embedded software. This problem is motivated by the increasing growth of embedded systems and a lack of ...