So one of the problems I'm having is coming up with an algorithm for dealing with a workflow/scheduler situation where there are complex dependancies of tasks. Essentially where there are multiple parents, and therefore in some cases multiple children. I'm having trouble finding a simple algorithm to solve this problem.
Brute force of course will work for a small problem, but I'm looking for something that will scale to larger volumes of items. I can present this problem at the meeting and the approach I've taken to the problem -----Original Message----- From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of G. Wade Johnson Sent: Friday, April 04, 2008 1:13 PM To: [email protected] Subject: Re: [pm-h] April Meeting On Fri, 4 Apr 2008 12:59:39 -0500 [EMAIL PROTECTED] wrote: > Wade, > > I would think that I could definitley come up with some. Do you want > them listed up front? I'm more thinking of trying to convince more people to come to the meeting. If you think listing some ideas would help, feel free. G. Wade Generally, this communication is for informational purposes only and it is not intended as an offer or solicitation for the purchase or sale of any financial instrument or as an official confirmation of any transaction. In the event you are receiving the offering materials attached below related to your interest in hedge funds or private equity, this communication may be intended as an offer or solicitation for the purchase or sale of such fund(s). All market prices, data and other information are not warranted as to completeness or accuracy and are subject to change without notice. Any comments or statements made herein do not necessarily reflect those of JPMorgan Chase & Co., its subsidiaries and affiliates. This transmission may contain information that is privileged, confidential, legally privileged, and/or exempt from disclosure under applicable law. If you are not the intended recipient, you are hereby notified that any disclosure, copying, distribution, or use of the information contained herein (including any reliance thereon) is STRICTLY PROHIBITED. Although this transmission and any attachments are believed to be free of any virus or other defect that might affect any computer system into which it is received and opened, it is the responsibility of the recipient to ensure that it is virus free and no responsibility is accepted by JPMorgan Chase & Co., its subsidiaries and affiliates, as applicable, for any loss or damage arising in any way from its use. If you received this transmission in error, please immediately contact the sender and destroy the material in its entirety, whether in electronic or hard copy format. Thank you. Please refer to http://www.jpmorgan.com/pages/disclosures for disclosures relating to UK legal entities. _______________________________________________ Houston mailing list [email protected] http://mail.pm.org/mailman/listinfo/houston Website: http://houston.pm.org/
