Hello,
I am currently working on a project related to the
Frequency Allocation Problem, and its implementation
through constraint programming. I have decided to use
Oz for this project, but have yet to master it. I was
therefore wondering if somebody could help me with the
following difficulty:
One of the input used for this problem is the demand
vector, which indicates the number of channel needed
for each cell of the network. For example, the
following input:
Demand = demand(5 7 3 5)
means that four cells exist in the network, and that
their respective capacity are 5, 7, 3 and 5. Since
each unit of capacity must be associated to a
variable, the end results must therefore be a record
like:
Channel = channel( (_ _ _ _ _) (_ _ _ _ _ _ _) (_ _ _)
(_ _ _ _ _) )
where each "_" represents one of the needed variable.
Unfortunatly, I have been unable to achieve such as
result, even if it's somewhat basic. Does somebody
have a helpfull suggestion on how to procede?
Thank you for your help,
Alain Ducharme
__________________________________________________
Do You Yahoo!?
Get Yahoo! Mail - Free email you can access from anywhere!
http://mail.yahoo.com/
-
Please send submissions to users@mozart-oz.org
and administriva mail to users-request@mozart-oz.org.
The Mozart Oz web site is at http://www.mozart-oz.org/.