|
 Application Catalog |
POP
|
Computes optimal partitions.
|
Category: Life Sciences
Sub Category: Computational Chemistry
Publisher: Michel Petitjean
Date Published: 2002
Version: 1.0
Pricing: License, free
Runtime: $1/CPU-hr.
What is a CPU-hr.?
A CPU-hr. is the aggregate CPU time spent across all machines, rounded up to the nearest hour (e.g., a task running on 1,000 CPUs for one minute = 1,000 CPU minutes or approximately 17 CPU hours, costing you only $17).
|
Key Features
 |
- Algorithm computes the optimal cost and the optimal partition(s).
|
Description |
POP reads either an (N*N) array of signed similarities, or an array containing N lines (individuals) and P columns (categorical variables), which will be converted into signed similarities. Then POP computes an optimal partition. It is possible to use the algorithm to compute an optimal partition or to enumerate all the optimal partitions.
|
Technical Information |
Input parameters: PGM - indicates which kind of array will be read, INI - indicates what will be done prior to computing partitions, OPT - indicates how many optimal partitions are needed, N - number of individuals, and P - number of categorical variables. |
Publisher Information |
Michel Petitjean
DSV/iBiTec-S/SB2SM (CNRS URA 2096), CEA Saclay, bât. 528
91191 Gif-sur-Yvette Cedex, France.
|
Pricing and Payment Information |
License: Free
Order Information
|
Support: |
Email support
|
 See All Applications
|
JOIN NOW*
Get 20 CPU-hours for free!
Limited time only
*International Access - now available in 25 countries.
25 Countries
United States, Australia, Austria, Belgium, Canada, China, Czech Republic, Denmark, Finland, France, Germany, Greece, Hungary, India, Ireland, Italy, Japan, Netherlands, New Zealand, Poland, Portugal, Singapore, Spain, Sweden, and the United Kingdom.
Please fill out our form to be informed when service is available in your region.
|
