@inproceedings{iMapping:SWUI06:poster, title = {iMapping - a Graphical Approach to Semi-Structured Knowledge Modelling}, author = {Heiko Haller}, booktitle = {Proceedings of the The 3rd International Semantic Web User Interaction Workshop (SWUI2006)}, editor = {Lloyd Rutledge}, month = {NOV}, note = {Poster presented at the The 3rd International Semantic Web User Interaction Workshop.}, url = {\url{http://www.aifb.uni-karlsruhe.de/WBS/hha/papers/iMapping_SWUI2006_paper.pdf}}, year = {2006}, biburl = {http://www.bibsonomy.org/bibtex/2b9b6793589b298ab74bb55b15f80d517/heikohaller}, description = {Institut AIFB - Publikationen}, keywords = {iMapping imported } } @article{journals/sigcse/HendersonBDDFGGHHLMMRW01, title = {Striving for mathematical thinking.}, author = {Peter B. Henderson and Doug Baldwin and Venu Dasigi and Marcel Dupras and Jane Fritz and David Ginat and Don Goelman and John Hamer and Lews E. Hitchner and Will Lloyd and Bill Marion and Jr. and Charles Riedesel and Henry Walker}, journal = {SIGCSE Bulletin}, number = {4}, pages = {114-124}, url = {http://dblp.uni-trier.de/db/journals/sigcse/sigcse33.html#HendersonBDDFGGHHLMMRW01}, volume = {33}, year = {2001}, biburl = {http://www.bibsonomy.org/bibtex/2addc2156d7262063cd70b23694c61203/dblp}, description = {dblp}, ee = {http://doi.acm.org/10.1145/572139.572180}, date = {2008-07-17}, keywords = {dblp } } @inproceedings{conf/mobiquitous/CheZL07, title = {Optimal Relay Node Fault Recovery.}, author = {Fei Che and Liang Zhao and Errol L. Lloyd}, booktitle = {MobiQuitous}, crossref = {conf/mobiquitous/2007}, pages = {1-8}, publisher = {IEEE}, url = {http://dblp.uni-trier.de/db/conf/mobiquitous/mobiquitous2007.html#CheZL07}, year = {2007}, biburl = {http://www.bibsonomy.org/bibtex/2a940575d267feb4d2edc2403efb44329/dblp}, description = {dblp}, ee = {http://dx.doi.org/10.1109/MOBIQ.2007.4451039}, date = {2008-07-11}, keywords = {dblp } } @inproceedings{conf/qest/SmithLPW07, title = {Interchange Formats for Performance Models: Experimentation and Ouput.}, author = {Connie U. Smith and Catalina M. Lladó and Ramón Puigjaner and Lloyd G. Williams}, booktitle = {QEST}, crossref = {conf/qest/2007}, pages = {91-100}, publisher = {IEEE Computer Society}, url = {http://dblp.uni-trier.de/db/conf/qest/qest2007.html#SmithLPW07}, year = {2007}, biburl = {http://www.bibsonomy.org/bibtex/2d3da1dd2ce8fc261b669ab0af277098f/dblp}, description = {dblp}, ee = {http://doi.ieeecomputersociety.org/10.1109/QEST.2007.24}, isbn = {0-7695-2883-X}, date = {2008-07-09}, keywords = {dblp } } @inproceedings{conf/ht/HardmanOMRB99, title = {Do you have the Time? Composition and Linking in Time-Based Hypermedia.}, author = {Lynda Hardman and Jacco van Ossenbruggen and K. Sjoerd Mullender and Lloyd Rutledge and Dick C. A. Bulterman}, booktitle = {Hypertext}, crossref = {conf/ht/99}, pages = {189-196}, publisher = {ACM}, url = {http://dblp.uni-trier.de/db/conf/ht/ht99.html#HardmanOMRB99}, year = {1999}, biburl = {http://www.bibsonomy.org/bibtex/2bc9ff80eeda31ba42394b6d19eee2b18/dblp}, description = {dblp}, ee = {http://doi.acm.org/10.1145/294469.294515}, cdrom = {HT1999/P189.pdf}, date = {2008-06-30}, keywords = {dblp } } @inproceedings{conf/ht/RutledgeHOB99, title = {Mix'n'match: Exchangeable Modules of Hypermedia Style.}, author = {Lloyd Rutledge and Lynda Hardman and Jacco van Ossenbruggen and Dick C. A. Bulterman}, booktitle = {Hypertext}, crossref = {conf/ht/99}, pages = {179-188}, publisher = {ACM}, url = {http://dblp.uni-trier.de/db/conf/ht/ht99.html#RutledgeHOB99}, year = {1999}, biburl = {http://www.bibsonomy.org/bibtex/23dd412fe5ee4f20f8cd981ecb91157cd/dblp}, description = {dblp}, ee = {http://doi.acm.org/10.1145/294469.294514}, cdrom = {HT1999/P179.pdf}, date = {2008-06-30}, keywords = {dblp } } @inproceedings{conf/iccS/SzczerbaLBS08, title = {A Multiphysics Model of Myoma Growth.}, author = {Dominik Szczerba and Bryn A. Lloyd and Michael Bajka and Gábor Székely}, booktitle = {ICCS (2)}, crossref = {conf/iccS/2008-2}, editor = {Marian Bubak and G. Dick van Albada and Jack Dongarra and Peter M. A. Sloot}, pages = {187-196}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, url = {http://dblp.uni-trier.de/db/conf/iccS/iccS2008-2.html#SzczerbaLBS08}, volume = {5102}, year = {2008}, biburl = {http://www.bibsonomy.org/bibtex/21d9ee5b7ef063fa3a7ac03009a893cf1/dblp}, description = {dblp}, date = {2008-06-30}, ee = {http://dx.doi.org/10.1007/978-3-540-69387-1_21}, isbn = {978-3-540-69386-4}, keywords = {dblp } } @article{journals/sigcse/NeemanLMN06, title = {Analogies for teaching parallel computing to inexperienced programmers.}, author = {Henry Neeman and Lloyd Lee and Julia Mullen and Gerard Newman}, journal = {SIGCSE Bulletin}, number = {4}, pages = {64-67}, url = {http://dblp.uni-trier.de/db/journals/sigcse/sigcse38.html#NeemanLMN06}, volume = {38}, year = {2006}, biburl = {http://www.bibsonomy.org/bibtex/297f437e5d737e5def68ff9e26c6a04f1/dblp}, description = {dblp}, ee = {http://doi.acm.org/10.1145/1189136.1189172}, date = {2008-06-27}, keywords = {dblp } } @inproceedings{svangard:2003:ugpwnppoefpo, title = {Using genetic programming with negative parsimony pressure on exons for portfolio optimization}, address = {Canberra}, author = {Nils Svangard and Peter Nordin and Stefan Lloyd}, booktitle = {Proceedings of the 2003 Congress on Evolutionary Computation CEC2003}, editor = {Ruhul Sarker and Robert Reynolds and Hussein Abbass and Kay Chen Tan and Bob McKay and Daryl Essam and Tom Gedeon}, month = {8-12 December}, pages = {1014--1017}, publisher = {IEEE Press}, year = {2003}, biburl = {http://www.bibsonomy.org/bibtex/2e4b3aa1e4146b552c2bf5baf19382928/brazovayeye}, abstract = {Traditionally Parsimony Pressure has been used with Genetic Programming to reduce the complexity of solutions analogous to the principle of Occam's Razor. But there have been several signs from previous experiments that this reduces the quality of the solutions. In an attempt to counteract this we presents one of the first experiments that try to apply negative parsimony pressure on genetic programming, ie. we prefer complex solutions rather than simpler ones. This system is then applied on a financial portfolio optimisation problem to test it's performance on real world data. Our results indicate that negative parsimony pressure work better than regular parsimony pressure on average, and it's almost always better to use some kind of parsimony pressure than not.}, organisation = {IEEE Neural Network Council (NNC), Engineers Australia (IEAust), Evolutionary Programming Society (EPS), Institution of Electrical Engineers (IEE)}, publisher_address = {445 Hoes Lane, P.O. Box 1331, Piscataway, NJ 08855-1331, USA}, isbn = {0-7803-7804-0}, notes = {CEC 2003 - A joint meeting of the IEEE, the IEAust, the EPS, and the IEE.}, keywords = {algorithms, genetic programming } } @inproceedings{svangard:2002:SEAL, title = {Parallell Evolution of Trading Strategies Based on Binary Classification Using Sub-Machine-Code Genetic Programming}, address = {Orchid Country Club, Singapore}, author = {Nils Svangard and Peter Nordin and Stefan Lloyd}, booktitle = {Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution And Learning (SEAL'02)}, editor = {Lipo Wang and Kay Chen Tan and Takeshi Furuhashi and Jong-Hwan Kim and Xin Yao}, month = {18-22 November}, year = {2002}, biburl = {http://www.bibsonomy.org/bibtex/2dbad11a29c78ea5df94669fb7ed7f417/brazovayeye}, isbn = {981-04-7522-5}, notes = {SEAL 2002}, keywords = {algorithms, genetic programming } }