Search Results for "minimum spanning tree"
Sort By:
7 projects for "minimum spanning tree" with 2 filters applied:
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
CloudPower
A tool for organising, visualising and executing Web resources.
CloudPower is a Java application that offers functionality similar to that found in operating systems, for the World Wide Web. References to Web resources, whether they be static or dynamic can be arranged into sets. These sets can themselves contain other sets, allowing for resources to be arranged like files on an operating system. These sets can be saved and retrieved, allowing users to organise their cloud resources. Two graph visualisations (hierarchy and energy) let users quickly... -
2
IEEE 802.1d ethernet bridging (plus Spanning Tree protocol) for the linux kernel. Kernel code is in Linux 2.4 and 2.6 kernels.
-
3
Alternative approach to minimum redundancy coding (fixed-length) without using tree data structures. The main advantages are simplicity and flexibility.
-
4
Weyland is a tool that collects information about a switched network, presents the information in a convenient format, and displays a graph of the spanning tree of the network.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
5
A Java userland file synchronization program that runs as a daemon. Designed synchronize between many systems simultaneously. Builds a minimal spanning tree for bandwidth efficient update distribution.
-
6
Numerically estimate an efficiency of code construction algorithms. Randomly generate n binary words of length m with minimum Hamming distance d and create a prefix code (= retrieval tree) from them. Based on PhD work.
-
7
- Previous
- You're on page 1
- Next
