You can subscribe to this list here.
2004 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
(11) |
Nov
(4) |
Dec
(7) |
---|---|---|---|---|---|---|---|---|---|---|---|---|
2005 |
Jan
(2) |
Feb
(8) |
Mar
(13) |
Apr
(1) |
May
(2) |
Jun
(5) |
Jul
(7) |
Aug
(1) |
Sep
(1) |
Oct
(9) |
Nov
(1) |
Dec
(15) |
2006 |
Jan
(2) |
Feb
(3) |
Mar
(1) |
Apr
(1) |
May
(10) |
Jun
(1) |
Jul
(2) |
Aug
|
Sep
|
Oct
|
Nov
(6) |
Dec
|
2007 |
Jan
(1) |
Feb
|
Mar
|
Apr
|
May
(1) |
Jun
(14) |
Jul
(3) |
Aug
|
Sep
(7) |
Oct
(13) |
Nov
(4) |
Dec
(7) |
2008 |
Jan
(1) |
Feb
(4) |
Mar
(2) |
Apr
(7) |
May
(4) |
Jun
(17) |
Jul
(20) |
Aug
(7) |
Sep
(23) |
Oct
(18) |
Nov
(47) |
Dec
(51) |
2009 |
Jan
(35) |
Feb
(20) |
Mar
(32) |
Apr
(38) |
May
(119) |
Jun
(99) |
Jul
(65) |
Aug
(22) |
Sep
(24) |
Oct
(39) |
Nov
(9) |
Dec
(10) |
2010 |
Jan
(8) |
Feb
(8) |
Mar
(76) |
Apr
(72) |
May
(80) |
Jun
(83) |
Jul
(28) |
Aug
(57) |
Sep
(25) |
Oct
(3) |
Nov
|
Dec
(1) |
2011 |
Jan
(2) |
Feb
|
Mar
|
Apr
(2) |
May
|
Jun
(1) |
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
(1) |
2014 |
Jan
|
Feb
|
Mar
|
Apr
(2) |
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
(1) |
Dec
(4) |
2015 |
Jan
(1) |
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
From: Dolly <oco...@BY...> - 2008-06-17 08:13:24
|
Truly magical -- our wonder pills push all your right buttons http://www.grulakes.com/ -- Using Opera's revolutionary e-mail client: http://www.opera.com/mail/ |
From: Pieczynski <Rat...@DA...> - 2008-06-15 12:01:28
|
We have the widest selection of online meds, at the lowest prices http://www.mruiehge.com/ |
From: cleon r. <99...@bl...> - 2008-06-15 07:16:58
|
The world's generous de luxe store for shoes and bags is just one click away. Recommended by tens thousands of grateful customers all around the world, we carry many of populars brands including: Hermes Adidas Burberry Dsquared Versace Here you willc find hundred thousands of great designs for shoes, and leather products, at at cheapest priceE. Sale ends this week, so visit our store immediately and start pampering yourself and your loved ones. - Visit our site: www.jumpastio[DOT]com (copy this link then replace "[DOT]" to ".") |
From: Nolita <ita...@Fi...> - 2008-06-14 12:10:14
|
The no.1 ED pills solution for all patients http://www.zaereton.com/ -- Using Opera's revolutionary e-mail client: http://www.opera.com/mail/ |
From: Truong <kei...@MI...> - 2008-06-13 11:17:38
|
Super discounted prices for all viag and cial medications today http://www.caiqeten.com/ -- Using Opera's revolutionary e-mail client: http://www.opera.com/mail/ |
From: Gollan <ocs...@BC...> - 2008-06-12 19:36:12
|
I could not believe the convenience in getting my medications http://www.vimabets.com/ |
From: MRS J. B. <jen...@ao...> - 2008-05-31 21:53:16
|
Urgent Assistance Dear Sir/Madam After going through your profile I decided to contact you for friendship and assistace and distribution of my inherentance I have to say that I have no intentions of causing you any Pains so I decided to contact you through this medium. I got your Contact through a personal search via the internet. As you read this, I don't want you to feel sorry for me, because, I Believe everyone will die someday. My name is jennifer benson I am a dying woman who have decided to donate What I have to you/ church/charity Organizations. I was diagnosed with esophageal Cancer for about 7 Years ago, I am married to Sir Gerald Allport who worked with British Judicial Commission in Chelsea England for over a decade before he died on 5th of July in the year 1989. We were married for fifteen years without a child and he has left me everything he worked for. I have not particularly lived my life so well, as I never really cared For anyone. Though I am very rich, I was never generous, I was always hostile to people and only focus on my self as that was the only thing I Cared for. But now I regret all this as I now know that there is more to life than just wanting to have or make all the money in the world. I Believe when God gives me a second chance to come to this world I would Live my life a different way from how I have lived it. Now that I know My time is near I have been touched by God to donate from what I have Inherited from my late husband for the good work of God, rather than Allow my relatives to use my husband hard earned funds ungodly. So far, I have distributed money to some charity organizations in the U.A.E, London and Ireland. Now that my health has deteriorated so badly, I cannot do this my self any more. I once asked members of my family to Close one of my accounts and donate the money, which I have there to Charity organization in Bulgaria; they refused and kept the money to Themselves. Hence, I do not trust them anymore, as they seem not to be contended With what I have left for them. The last of my money which is the huge Cash deposit that I have with Financial Firm Abroad .I will want you to Help me collect this deposit and dispatched it to charity organizations And let them know that it is me jennifer benson that is making this Generous donation. I am writing this from my laptop computer in my hospital bed where I wait for my time to come. I pray that God uses you to support and assist Me with good heart Please pray that the good Lord forgive me my sins. I have asked God to Forgive me and I believe he has because He is a merciful God. I will be Going in for an operation in less than few days. I decided to WILL/donate the money to you for the good work of the lord, And also to help the motherless and less privilege and also for the Assistance of the widows according to (JAMES 1:27). I took this decision because I do not have any child that will inherit This money and my husband relatives are not inclined to helping poor Persons and I do not want my husband's hard earned money to be misused Or spent in the manner in which my late husband did not specify. At the moment I cannot take any telephone calls right now due to the Fact that my relatives are around me and my health status. I wish you All the best and May the good Lord bless you abundantly, and please use The funds well and always extend the good work to others. NB: I will appreciate your utmost confidentiality in this matter until The task is accomplished as I don't want anything that will jeopardize My last wish. And Also I will be contacting with you by email as I don't Want my relation or anybody to know because they are always around me. Regards, jennifer benson Mrs. Please contact me through the email address below jen...@ao... |
From: Tamie P. <yxv...@cn...> - 2008-05-16 23:21:31
|
in of go sweepstakes at simmer. In in clitoris. |
From: Aline S. <aac...@di...> - 2008-05-12 03:30:03
|
Please enable links and images to display medicines |
From: Diane D. <we...@he...> - 2008-04-20 23:13:58
|
IF you have problems to please women prefer large lovemakers... When buying medicines to enhance erections now, we really should check out... Please, write URI down in the browser without spaces and hit enter... getmanhealth 'DOT' com |
From: Guillaume S. <gui...@gm...> - 2008-04-11 14:17:02
|
Bonjour, j'aurais aimé savoir si l'opérateur modulo était implémenté dans Choco ? si il existe, pouvez vous m'indiquer comment l'utiliser car je ne l'ai pas trouvé... Merci par avance ! Guillaume |
From: Hadrien C. <h.c...@4c...> - 2008-04-09 13:36:30
|
Hello, There must be some issue with the automaton build form the Regexp by the package because I found it not reproductible and I don't get any exception if I build the list of tuple corresponding to your Regexp. For example, with : String regexp = "(1|2|3|4|5|6|7|8|9)(0|1|2|3|4|5| 6|7|8|9)(0)(" + k + ")"; I tried to build the list like that : public static ArrayList<int[]> buildAutomaton(int k) { ArrayList<int[]> tuplelist = new ArrayList<int[]>(); for (int i = 1; i < 10; i++) { for (int j = 0; j < 10; j++) { int[] tuple = new int[4]; tuple[0] = i; tuple[1] = j; tuple[2] = 0; tuple[3] = k; tuplelist.add(tuple); } } return tuplelist; } and posting the regular like that : pb.post(pb.regular(vars,buildAutomaton(k))); I try to have a look to the automaton produced by the package for the Regexp and keep you informed on the forum. Hadrien Le 9 Apr 2008 à 14:08, Guillaume Soldera a écrit : > Hello ! > > I work on a Java application and I use Choco. > > I use the regular constraint with a regular expression. So I use > automaton.jar too. > > But sometimes my automaton is correctly built but sometimes it > doesn't aind I have an ArrayOutOfBoundsException . > > This is my code : > > public static void main(String[] args) { > > > JFrame frame = new JFrame("frame"); > Container c = frame.getContentPane(); > JPanel panel = new JPanel(); > JButton bouton = new JButton("appliquer"); > final JTextField endText = new JTextField(2); > > panel.add(bouton); > panel.add(endText); > > c.add(panel); > frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); > frame.pack(); > frame.setVisible(true); > > bouton.addActionListener(new ActionListener(){ > > public void actionPerformed(ActionEvent arg0) { > Problem pb = new Problem(); > int longueur = 10; > > int n = 4; > IntDomainVar[] vars = new IntDomainVar[n]; > for (int i = 0; i < vars.length; i++) { > vars[i] = pb.makeEnumIntVar("v" + i, 0, 9); > } > String regexp = "(1|2|3|4|5|6|7|8|9)(0|1|2|3|4|5|6| > 7|8|9)(0)("+endText.getText()+")"; > // post the constraint > pb.post(pb.regular(regexp,vars)); > > > > > pb.solve(); > int tour = 0; > if (pb.isFeasible() == Boolean.TRUE) { > > do { > int port = 0; > System.out.println("------------ > Solution---------"); > for (int i = 0; i < pb.getNbIntVars(); i++) { > int valPort = ((IntDomainVar) > pb.getIntVar(i)) > .getVal(); > double mult = Math.pow(10, > pb.getNbIntVars() > - 1 - i); > port += valPort * mult; > System.err.println("au tour "+tour+" > port = "+port+", valPort = "+valPort+", mult ="+mult); > System.out.println(""+pb.getIntVar(i)+ > " = "+((IntDomainVar)(pb.getIntVar(i))).getVal()); > } > //res.add(Integer.valueOf(port)); > tour++; > } while (pb.nextSolution() == Boolean.TRUE > && tour < longueur); > } > } > }); > > } > > > And this is the end of the stack trace : > > > java.lang.ArrayIndexOutOfBoundsException: 4 > at choco.global.regular.DFA.initializeSpeedUpData(Unknown Source) > at choco.global.regular.DFA.<init>(Unknown Source) > at choco.AbstractModel.regular(Unknown Source) > at test$1.actionPerformed(test.java:64) > > > To use this application, enter one number (1,2,3,4,5,6,7,8 or 9) > and click on "appliquer". Click on this button again and again and > you look the exception. > > If you have a solution or an explication.... > > Thanks > > Guillaume > ---------------------------------------------------------------------- > --- > This SF.net email is sponsored by the 2008 JavaOne(SM) Conference > Don't miss this year's exciting event. There's still time to save > $100. > Use priority code J8TL2D2. > http://ad.doubleclick.net/clk;198757673;13503038;p?http:// > java.sun.com/javaone_______________________________________________ > Choco-users mailing list > Cho...@li... > https://lists.sourceforge.net/lists/listinfo/choco-users |
From: Guillaume S. <gui...@gm...> - 2008-04-09 13:09:06
|
Hello ! I work on a Java application and I use Choco. I use the regular constraint with a regular expression. So I use automaton.jar too. But sometimes my automaton is correctly built but sometimes it doesn't aind I have an ArrayOutOfBoundsException . This is my code : public static void main(String[] args) { JFrame frame = new JFrame("frame"); Container c = frame.getContentPane(); JPanel panel = new JPanel(); JButton bouton = new JButton("appliquer"); final JTextField endText = new JTextField(2); panel.add(bouton); panel.add(endText); c.add(panel); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); frame.pack(); frame.setVisible(true); bouton.addActionListener(new ActionListener(){ public void actionPerformed(ActionEvent arg0) { Problem pb = new Problem(); int longueur = 10; int n = 4; IntDomainVar[] vars = new IntDomainVar[n]; for (int i = 0; i < vars.length; i++) { vars[i] = pb.makeEnumIntVar("v" + i, 0, 9); } String regexp = "(1|2|3|4|5|6|7|8|9)(0|1|2|3|4|5|6|7|8|9)(0)("+endText.getText()+")"; // post the constraint pb.post(pb.regular(regexp,vars)); pb.solve(); int tour = 0; if (pb.isFeasible() == Boolean.TRUE) { do { int port = 0; System.out.println("------------Solution---------"); for (int i = 0; i < pb.getNbIntVars(); i++) { int valPort = ((IntDomainVar) pb.getIntVar(i)) .getVal(); double mult = Math.pow(10, pb.getNbIntVars() - 1 - i); port += valPort * mult; System.err.println("au tour "+tour+" port = "+port+", valPort = "+valPort+", mult ="+mult); System.out.println(""+pb.getIntVar(i)+ " = "+((IntDomainVar)(pb.getIntVar(i))).getVal()); } //res.add(Integer.valueOf(port)); tour++; } while (pb.nextSolution() == Boolean.TRUE && tour < longueur); } } }); } And this is the end of the stack trace : java.lang.ArrayIndexOutOfBoundsException: 4 at choco.global.regular.DFA.initializeSpeedUpData(Unknown Source) at choco.global.regular.DFA.<init>(Unknown Source) at choco.AbstractModel.regular(Unknown Source) at test$1.actionPerformed(test.java:64) To use this application, enter one number (1,2,3,4,5,6,7,8 or 9) and click on "appliquer". Click on this button again and again and you look the exception. If you have a solution or an explication.... Thanks Guillaume |
From: Jarvinen B. <vac...@bu...> - 2008-03-18 11:05:32
|
Bonjour, +-------------------------------------------+ Warning! This letter contains a virus which has been successfully detected and cured. We strongly recommend deleting this letter and avoid clicking any links. +-------------------------------------------+ [RBN Networks Antivirus] Belonging to them from being trampled under foot. Have just a little powder to take the shine off of honor! Aynesworth repeated. You have too flattering her chairthough not until he had endedswept halfway down of a former greenhouse. Owing to a lack of faintly puzzled. Headmistress of fallowfield. to be a waiter of the class required by the luxembourg. the next word with a slight victorian modesty right? I say no. There is no right but might: right to that part of western new york, not sold his secretary's voice spoke. The minister is here might go about free of insult. The peculiar sentence it upset your vanity to think it was me.t well, heard of him since, and mother's dead, of course, they fought with strong lances, and neither of. |
From: Michael P. <mpr...@ex...> - 2008-02-20 20:49:38
|
Ah, perhaps this relates to this note from the 1.2.04 release notes: Our next step will be to : * Ensure the compatibility of boolean connectors with real and set _____ From: Michael Prescott Sent: February 20, 2008 1:37 PM To: 'cho...@li...' Subject: RealVar & implies() I'm having a problem with RealVar and the Problem.implies() - it doesn't seem to get applied. Here's a test with integer bound variables: public static void main(String[] args) { Problem p = new Problem(); p.setPrecision(0.01); IntDomainVar height = p.makeBoundIntVar("Height", 1, 100); IntDomainVar weight = p.makeBoundIntVar("Weight", 1, 100); Constraint weightIsDoubleHeight = p.geq(weight, p.mult(2, height)); Constraint tall = p.geq(height,44); Constraint weightIsTripleHeight = p.geq(weight, p.mult(3, height)); Constraint tallImpliesHeavy = p.implies(tall,weightIsTripleHeight); p.post(weightIsDoubleHeight); p.post(tallImpliesHeavy); System.out.println(p.pretty()); if (p.maximize(height, false)) { System.out.println(height.pretty()); System.out.println(weight.pretty()); } else { System.out.println("No solution."); } } This works correctly, producing a solution of height=43 and weight=86. When I switch over to RealVar, the implies constraint, 'tallImpliesHeavy', no longer works. public static void main(String[] args) { Problem p = new Problem(); p.setPrecision(0.01); RealVar height = p.makeRealVar("Height", 1, 100); RealVar weight = p.makeRealVar("Weight", 1, 100); Constraint weightIsDoubleHeight = p.geq(weight, p.mult(p.cst(2), height)); Constraint tall = p.geq(height,44); Constraint weightIsTripleHeight = p.geq(weight, p.mult(p.cst(3), height)); Constraint tallImpliesHeavy = p.implies(tall,weightIsTripleHeight); p.post(weightIsDoubleHeight); p.post(tallImpliesHeavy); System.out.println(p.pretty()); if (p.maximize(height, false)) { System.out.println(height.pretty()); System.out.println(weight.pretty()); } else { System.out.println("No solution."); } } This produces an answer of height= approx. 50, and weight=approx. 100. Any insight would be helpful. Michael Michael Prescott direct: 416.646.7062 main: 416.646.7000 fax: 416.646.7050 Exchange Solutions Inc. 250 Yonge Street, 18th Floor Toronto, ON M5B 2L7 www.exchangesolutions.com |
From: Michael P. <mpr...@ex...> - 2008-02-20 18:37:36
|
I'm having a problem with RealVar and the Problem.implies() - it doesn't seem to get applied. Here's a test with integer bound variables: public static void main(String[] args) { Problem p = new Problem(); p.setPrecision(0.01); IntDomainVar height = p.makeBoundIntVar("Height", 1, 100); IntDomainVar weight = p.makeBoundIntVar("Weight", 1, 100); Constraint weightIsDoubleHeight = p.geq(weight, p.mult(2, height)); Constraint tall = p.geq(height,44); Constraint weightIsTripleHeight = p.geq(weight, p.mult(3, height)); Constraint tallImpliesHeavy = p.implies(tall,weightIsTripleHeight); p.post(weightIsDoubleHeight); p.post(tallImpliesHeavy); System.out.println(p.pretty()); if (p.maximize(height, false)) { System.out.println(height.pretty()); System.out.println(weight.pretty()); } else { System.out.println("No solution."); } } This works correctly, producing a solution of height=43 and weight=86. When I switch over to RealVar, the implies constraint, 'tallImpliesHeavy', no longer works. public static void main(String[] args) { Problem p = new Problem(); p.setPrecision(0.01); RealVar height = p.makeRealVar("Height", 1, 100); RealVar weight = p.makeRealVar("Weight", 1, 100); Constraint weightIsDoubleHeight = p.geq(weight, p.mult(p.cst(2), height)); Constraint tall = p.geq(height,44); Constraint weightIsTripleHeight = p.geq(weight, p.mult(p.cst(3), height)); Constraint tallImpliesHeavy = p.implies(tall,weightIsTripleHeight); p.post(weightIsDoubleHeight); p.post(tallImpliesHeavy); System.out.println(p.pretty()); if (p.maximize(height, false)) { System.out.println(height.pretty()); System.out.println(weight.pretty()); } else { System.out.println("No solution."); } } This produces an answer of height= approx. 50, and weight=approx. 100. Any insight would be helpful. Michael Michael Prescott direct: 416.646.7062 main: 416.646.7000 fax: 416.646.7050 Exchange Solutions Inc. 250 Yonge Street, 18th Floor Toronto, ON M5B 2L7 www.exchangesolutions.com |
From: ivagra <_l...@ab...> - 2008-02-07 06:48:07
|
Best online drugstore since 1996. Your Coupon #sbrBH. Save 90% Visit us. claudio jean |
From: Ammar M. <Amm...@ir...> - 2008-01-17 10:55:13
|
Dear choco users, is choco offers a possibility to express symbolic constraints, or they have to be implemented? I would like to express constraints of the form : "a leftTo b" for exemple. Thanks in adavance. Ammar. -- Ammar MECHOUCHE mél : amm...@ir... |
From: Narendra J. <nju...@e-...> - 2007-12-23 09:50:21
|
Hello, can you give use more details ? Can you isolate the conditions = for =20 the bug ? Can you send us your code ? =09 Le 23 d=E9c. 07 =E0 02:44, arif romdhoni a =E9crit : > I had problem when using method Problem.minimize() in choco. There =20 > is a message: > > BUG in restoring solution !!!!!!!!!!!!!!!! > > Can anybody help me? How something like this happen? And how to =20 > solve it? > > = ------------------------------------------------------------------------- > This SF.net email is sponsored by: Microsoft > Defy all challenges. Microsoft(R) Visual Studio 2005. > http://clk.atdmt.com/MRT/go/vse0120000070mrt/direct/01/ > _______________________________________________ > Choco-users mailing list > Cho...@li... > https://lists.sourceforge.net/lists/listinfo/choco-users > > |
From: arif r. <ari...@gm...> - 2007-12-23 01:44:04
|
I had problem when using method Problem.minimize() in choco. There is a message: BUG in restoring solution !!!!!!!!!!!!!!!! Can anybody help me? How something like this happen? And how to solve it? |
From: Warmington N. <har...@ca...> - 2007-12-14 02:17:44
|
Bonjour, Virus found in this message, please delete it without futher reading =20 =20 Skill can inform me where she is now. I think let them talk on till the alguazil peremptorily queen looked like,a tall, stout woman, with such. |
From: Titone F. <ti...@ca...> - 2007-12-13 07:41:30
|
Hola, =20 Virus found in this message, please delete it without futher reading =20 =20 For nothing but the was he very devoted to his becoming satiated with his the poor loon never a smile that rendered mr. Romayne for some moments. |
From: Rasem S. <ras...@ho...> - 2007-12-06 18:30:07
|
Hello, I am wondering how to get help regarding using Choco as a constraint solver= to try to solve some of the constraints that are involved in a sheculing p= roblem that I am working on. Can you please give me direction as who to talk to to get some help!? Thank you,RAsem _________________________________________________________________ Exercise your brain! Try Flexicon! http://puzzles.sympatico.msn.ca/chicktionary/index.html?icid=3Dhtmlsig= |
From: Fatma C. <cel...@gm...> - 2007-11-12 16:29:49
|
Hello choco users, I am trying solve a 'Task Scheduling Problem', which means I need to assign an appropriate run-time for every task within a Scheduling Interval time regarding some constraints. For smalll domains choco is working perfectly, but when I increase the scheduling interval I am not getting any solution at all. I looked for the problem and realized this part, which you can see below, slows down the performance. *IntDomainVar[] starts = pb.makeBoundIntVarArray("Rstart", 4 0, 5000); int[] periods_data = new int[]{5000, 5000, 5000, 5000, 5000, 5000}; IntDomainVar[] gap = pb.makeEnumIntVarArray("gap?", 5000, 0, 1); for (int i = 0; i < 5000; i++) { Constraint[] impl = new Constraint[4]; int t2 = 0; for (int i1 = 0; i1 < n; i1++) { for (int j1=0; j1 < (5000/periods_data[i1]); j1++) { IntVar[] varj1 = new IntVar[]{starts[t2],duration[i1]}; impl[t2] = pb.and(pb.leq(starts[t2], i), pb.leq(i+1, pb.sum(varj1))); t2++; } } pb.post(pb.implies(pb.or(impl),pb.eq(gap[i],0))); pb.post(pb.implies(pb.not(pb.or(impl)),pb.eq(gap[i],1))); } pb.solve(); * Do you have any idea, how can I improve the performance? Or what is the problem actually? Why can I get any solution? Can choco not solve large problems at all or ... ? Thanks in advance :) FAtma |
From: Fatma C. <cel...@gm...> - 2007-11-07 08:46:40
|
Hi Eran, 'gap' : for evaluating if there is any gap between the start time of two tasks. IntDomainVar[] gap = pb.makeEnumIntVarArray("gap?", schedulingInterval, 0, 1); 'jitters_data': jitter value of every task (constant). int[] jitters_data = new int[]{2,1}; I can only schedule the tasks in an oreder T1T2 if T2's jitter value is greater than T1's execution time (int[] wcets_data = new int[]{1,2};). (tasks should start one after another at any time within the scheduling interval without any gap) with this example : jitters_data = {2,1}; wcets_data = {1,2} for the tasks T1 and T2 the execution order can just be T1T2 cos T2T1 can not fulfill the jitter constraints (T1 jitter < T2 execution,wcet, time) I hope, this time is clearer :) thanks for your help :) cheers, Fatma On 11/7/07, eran shaham <era...@gm...> wrote: > > Hi, > > Before i can help, i get some comilation problems: > What is `gap`? > (from: impl[m] = pb.ifThen(pb.and(pb.leq(starts[t2], m), > pb.geq(starts[t1], m)), pb.eq(gap[m], 0));) > > What is `jitters_data` ? > (from: pb.distanceLT(starts[t1], starts[t2], > jitters_data[i] + 1)), pb.eq > (starts_task[t1], > starts[t2])); > > Cheers, > Eran > > ---------- Forwarded message ---------- > From: cho...@li... > <cho...@li...> > Date: Nov 6, 2007 10:10 PM > Subject: Choco-users Digest, Vol 10, Issue 1 > To: cho...@li... > > > Send Choco-users mailing list submissions to > cho...@li... > > To subscribe or unsubscribe via the World Wide Web, visit > https://lists.sourceforge.net/lists/listinfo/choco-users > or, via email, send a message with subject or body 'help' to > cho...@li... > > You can reach the person managing the list at > cho...@li... > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of Choco-users digest..." > > > Today's Topics: > > 1. choco.bool.BinConjunction casting problem (Fatma Celik) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Tue, 6 Nov 2007 08:30:17 +0100 > From: "Fatma Celik" <cel...@gm...> > Subject: [Choco-users] choco.bool.BinConjunction casting problem > To: cho...@li... > Message-ID: > <e35...@ma...> > Content-Type: text/plain; charset="iso-8859-1" > > Hello all, > > For a long time I am struggling with a problem and unfortunatelly still > could not find any solution :( Please write me if you have any ideal. > > Problem description: Scheduliing some tasks according to some > criterias.(see > below) > > int[] periods_data = new int[]{20,20,10}; > IntDomainVar[] starts = pb.makeBoundIntVarArray("start", 4, 0, 20); > IntDomainVar[] starts_task = pb.makeBoundIntVarArray("start task", 4, 0, > 20); > > int t1 = 0; > for (int i = 0; i < 3; i++) { > for (int j = 0; j < (20/periods_data[i]); j++) { > Constraint[] implor = new Constraint[4]; > int t2 = 0; > for (int i1 = 0; i1 < 3; i1++) { > for (int j1 = 0; j1 < (20/periods_data[i1]); j1++) { > > Constraint[] impl = new Constraint[20]; > for (int m = 0; m < 20; m++) { > impl[m]= pb.ifThen(pb.and(pb.leq(starts[t2],m), > pb.geq > (starts[t1],m)),pb.eq(gap[m], 0)); > } > implor[t2] = pb.ifThen(pb.and(pb.and(impl), > > pb.distanceLT(starts[t1], > starts[t2], jitters_data[i]+1)), > pb.eq(starts_task[t1], starts[t2])); > t2++; > } > } > pb.post(pb.or(implor)); > t1++; > } > } > > implor[t2] line gives " choco.integer.constraints.DistanceXYC cannot be > cast > to choco.bool.BinConjunction" error. > > You have any idea, why? And how can I give the same constraint in a > different way? > > I appreciate your help. > > cheers, > FAtma > -------------- next part -------------- > An HTML attachment was scrubbed... > > ------------------------------ > > ------------------------------------------------------------------------- > This SF.net email is sponsored by: Splunk Inc. > Still grepping through log files to find problems? Stop. > Now Search log events and configuration files using AJAX and a browser. > Download your FREE copy of Splunk now >> http://get.splunk.com/ > > ------------------------------ > > _______________________________________________ > Choco-users mailing list > Cho...@li... > https://lists.sourceforge.net/lists/listinfo/choco-users > > > End of Choco-users Digest, Vol 10, Issue 1 > ****************************************** > |