474 search results - page 82 / 95 » On Multicast Path Finding Algorithms |
INFOCOM
2003
IEEE
14 years 28 days ago
2003
IEEE
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...
AAAI
2007
13 years 10 months ago
2007
Finding the exact treewidth of a graph is central to many operations in a variety of areas, including probabilistic reasoning and constraint satisfaction. Treewidth can be found b...
AIPS
2006
13 years 9 months ago
2006
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
EUROPAR
2010
Springer
13 years 8 months ago
2010
Springer
Manual parallelization of programs is known to be difficult and error-prone, and there are currently few ways to measure the amount of potential parallelism in the original sequent...
IJCM
2002
13 years 7 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...