2796 search results - page 56 / 560 » The coolest path problem |
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
124
click to vote
CORR
1999
Springer
14 years 11 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
ICC
2009
IEEE
15 years 6 months ago
2009
IEEE
—We have currently reached a phase where big shifts in the network traffic might impose to rethink the design of current architectures, and where new technologies, being pushed ...
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations of opera...
110
click to vote
ISAAC
2003
Springer
15 years 5 months ago
2003
Springer
We consider all-optical networks with shortest-path routing that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their...