Browsing Complete repository Arts & humanities   Archaeology   Art & art history   Classical & oriental studies   History   Languages & linguistics   Literature   Performing arts   Philosophy & ethics   Religion & theology   Multidisciplinary, general & others Business & economic sciences   Accounting & auditing   Production, distribution & supply chain management   Finance   General management & organizational theory   Human resources management   Management information systems   Marketing   Strategy & innovation   Quantitative methods in economics & management   General economics & history of economic thought   International economics   Macroeconomics & monetary economics   Microeconomics   Economic systems & public economics   Social economics   Special economic topics (health, labor, transportation…)   Multidisciplinary, general & others Engineering, computing & technology   Aerospace & aeronautics engineering   Architecture   Chemical engineering   Civil engineering   Computer science   Electrical & electronics engineering   Energy   Geological, petroleum & mining engineering   Materials science & engineering   Mechanical engineering   Multidisciplinary, general & others Human health sciences   Alternative medicine   Anesthesia & intensive care   Cardiovascular & respiratory systems   Dentistry & oral medicine   Dermatology   Endocrinology, metabolism & nutrition   Forensic medicine   Gastroenterology & hepatology   General & internal medicine   Geriatrics   Hematology   Immunology & infectious disease   Laboratory medicine & medical technology   Neurology   Oncology   Ophthalmology   Orthopedics, rehabilitation & sports medicine   Otolaryngology   Pediatrics   Pharmacy, pharmacology & toxicology   Psychiatry   Public health, health care sciences & services   Radiology, nuclear medicine & imaging   Reproductive medicine (gynecology, andrology, obstetrics)   Rheumatology   Surgery   Urology & nephrology   Multidisciplinary, general & others Law, criminology & political science   Civil law   Criminal law & procedure   Criminology   Economic & commercial law   European & international law   Judicial law   Metalaw, Roman law, history of law & comparative law   Political science, public administration & international relations   Public law   Social law   Tax law   Multidisciplinary, general & others Life sciences   Agriculture & agronomy   Anatomy (cytology, histology, embryology...) & physiology   Animal production & animal husbandry   Aquatic sciences & oceanology   Biochemistry, biophysics & molecular biology   Biotechnology   Entomology & pest control   Environmental sciences & ecology   Food science   Genetics & genetic processes   Microbiology   Phytobiology (plant sciences, forestry, mycology...)   Veterinary medicine & animal health   Zoology   Multidisciplinary, general & others Physical, chemical, mathematical & earth Sciences   Chemistry   Earth sciences & physical geography   Mathematics   Physics   Space science, astronomy & astrophysics   Multidisciplinary, general & others Social & behavioral sciences, psychology   Animal psychology, ethology & psychobiology   Anthropology   Communication & mass media   Education & instruction   Human geography & demography   Library & information sciences   Neurosciences & behavior   Regional & inter-regional studies   Social work & social policy   Sociology & social sciences   Social, industrial & organizational psychology   Theoretical & cognitive psychology   Treatment & clinical psychology   Multidisciplinary, general & others      by title 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z or enter first few letters:    OK Showing results 71819 to 71838 of 132010     3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596     Learning to play K-armed bandit problemsMaes, Francis ; Wehenkel, Louis ; Ernst, Damien in Proceedings of the 4th International Conference on Agents and Artificial Intelligence (ICAART 2012) (2012, February)We propose a learning approach to pre-compute K-armed bandit playing policies by exploiting prior information describing the class of problems targeted by the player. Our algorithm ﬁrst samples a set of K ... [more ▼]We propose a learning approach to pre-compute K-armed bandit playing policies by exploiting prior information describing the class of problems targeted by the player. Our algorithm ﬁrst samples a set of K-armed bandit problems from the given prior, and then chooses in a space of candidate policies one that gives the best average performances over these problems. The candidate policies use an index for ranking the arms and pick at each play the arm with the highest index; the index for each arm is computed in the form of a linear combination of features describing the history of plays (e.g., number of draws, average reward, variance of rewards and higher order moments), and an estimation of distribution algorithm is used to determine its optimal parameters in the form of feature weights. We carry out simulations in the case where the prior assumes a ﬁxed number of Bernoulli arms, a ﬁxed horizon, and uniformly distributed parameters of the Bernoulli arms. These simulations show that learned strategies perform very well with respect to several other strategies previously proposed in the literature (UCB1, UCB2, UCB-V, KL-UCB and $\epsilon_n$-GREEDY); they also highlight the robustness of these strategies with respect to wrong prior information. [less ▲]Detailed reference viewed: 136 (19 ULg) Learning to Predict End-to-End Network PerformanceLiao, Yongjun Doctoral thesis (2013)The knowledge of end-to-end network performance is essential to many Internet applications and systems including traffic engineering, content distribution networks, overlay routing, application-level ... [more ▼]The knowledge of end-to-end network performance is essential to many Internet applications and systems including traffic engineering, content distribution networks, overlay routing, application-level multicast, and peer-to-peer applications. On the one hand, such knowledge allows service providers to adjust their services according to the dynamic network conditions. On the other hand, as many systems are flexible in choosing their communication paths and targets, knowing network performance enables to optimize services by e.g. intelligent path selection. In the networking field, end-to-end network performance refers to some property of a network path measured by various metrics such as round-trip time (RTT), available bandwidth (ABW) and packet loss rate (PLR). While much progress has been made in network measurement, a main challenge in the acquisition of network performance on large-scale networks is the quadratical growth of the measurement overheads with respect to the number of network nodes, which renders the active probing of all paths infeasible. Thus, a natural idea is to measure a small set of paths and then predict the others where there are no direct measurements. This understanding has motivated numerous research on approaches to network performance prediction. Commonly, the success of a prediction system is built on its scalability, efficiency, accuracy and practicability. For network performance prediction, two specific requirements have to be met. First, the prediction system should have a decentralized architecture which allows the natural deployment of the system within a networked application. Second, as different performance metrics are useful for different applications, the prediction system should be general and flexible to deal with various metrics in a unified framework. This thesis presents practical approaches to network performance prediction. There are three main contributions. First, the problem of network performance prediction is formulated as a matrix completion problem where the matrix contains performance measures between network nodes with some of them known and the others unknown and thus to be filled. This new formulation is advantageous in that it is flexible to deal with various metrics in a unified framework, despite their diverse nature. The only requirement is that the matrix to be completed has a low-rank characteristic, which has long been observed in performance matrices constructed from various networks and in various metrics. Second, the matrix completion problem is solved by a novel approach called Decentralized Matrix Factorization by Stochastic Gradient Descent (DMFSGD). The approach requires neither explicit constructions of matrices nor special nodes such as landmarks and central servers. Instead, by letting network nodes exchange messages with each other, matrix factorization is collaboratively and iteratively achieved at all nodes, with each node equally retrieving a number of measurements. The approach is practical in that it is simple, with no infrastructure, and is computationally lightweight, containing only vector operations. Third, instead of the conventional representation of exact metric values, this thesis also investigates coarse performance representations including binary classes (The performance is classified into binary classes of either good'' or bad''.) and ordinal ratings (The performance is quantized from 1 star to 5 stars.). Such more qualitative than quantitative measures not only fulfill the requirements of many Internet applications, but also reduce the measurement cost and enable a unified treatment of various metrics. In addition, as both class and rating measures can be nicely integrated in the matrix completion framework, the same DMFSGD approach is applicable for their prediction, with little modification required. The resulting prediction system has been extensively evaluated on various publicly-available datasets of two kinds of metrics, namely RTT and ABW. These experiments demonstrate not only the scalability and the accuracy of the DMFSGD approach but also its usability in real Internet applications. In addition, the benefits of predicting performance classes and ratings, rather than their actual values, are demonstrated by a case study on peer selection, a function that is commonly required in a number of network applications. [less ▲]Detailed reference viewed: 91 (18 ULg) Learning to pronounce a second/foreign language. Pitch accent assignment in Dutch and French as a foreign languageRasier, Laurent Conference (2006)Detailed reference viewed: 11 (0 ULg) Learning to rank with extremely randomized treesGeurts, Pierre ; Louppe, Gilles in JMLR: Workshop and Conference Proceedings (2011, January), 14In this paper, we report on our experiments on the Yahoo! Labs Learning to Rank challenge organized in the context of the 23rd International Conference of Machine Learning (ICML 2010). We competed in both ... [more ▼]In this paper, we report on our experiments on the Yahoo! Labs Learning to Rank challenge organized in the context of the 23rd International Conference of Machine Learning (ICML 2010). We competed in both the learning to rank and the transfer learning tracks of the challenge with several tree-based ensemble methods, including Tree Bagging, Random Forests, and Extremely Randomized Trees. Our methods ranked 10th in the ﬁrst track and 4th in the second track. Although not at the very top of the ranking, our results show that ensembles of randomized trees are quite competitive for the “learning to rank” problem. The paper also analyzes computing times of our algorithms and presents some post-challenge experiments with transfer learning methods. [less ▲]Detailed reference viewed: 550 (75 ULg) Learning towards resilienceJones, Ronald; Diepart, Jean-Christophe in Diepart, Jean-Christophe (Ed.) Learning for resilience: Insights from Cambodia’s rural communities (2015)Detailed reference viewed: 23 (0 ULg) The Learning University Model and its use in Piloting a Higher Education CurriculumLeclercq, Dieudonné ; Dupont, Chantal ; Poumay, Marianne Report (2007)Detailed reference viewed: 94 (10 ULg) Learning Visual Representations for Interactive SystemsPiater, Justus ; Jodogne, Sébastien ; Detry, Renaud et alin 14th International Symposium on Robotics Research (2009)Detailed reference viewed: 13 (4 ULg) Learning Visual Representations for Perception-Action SystemsPiater, Justus ; JODOGNE, Sébastien ; Detry, Renaud et alin International Journal of Robotics Research (2011), 30(3), 294-307Detailed reference viewed: 20 (8 ULg) Learning, then Compacting Visual PoliciesJodogne, Sébastien ; Piater, Justus in 7th European Workshop on Reinforcement Learning (2005)Detailed reference viewed: 8 (3 ULg) Learning-Related Changes in Daytime Sleep EEG Paramters Depends on the Nature of the Word-Pair AssociatesSchmidt, Christina ; Peigneux, Philippe ; Muto, Vincenzo et alPoster (2006)Detailed reference viewed: 9 (1 ULg) Learrn-Nett, un réseau pour la formation des enseignants. Une communauté de pratique ?Lebrun, M.; Deschryver, N.; Charlier, B. et alin Charnet, Chantal; Ghersi, Claire; Monino, Jean-Louis (Eds.) Le défi de la qualité dans l'enseignement supérieur : vers un changement de paradigme. Actes du XXVe Colloque de l'Association Internationale de Pédagogie Universitaire (AIPU) (2008, May)Il y a plus de 10 ans, le réseau LEARN-NETT naissait de la rencontre de professeurs en sciences de l’éducation et était financé pendant trois ans, d’abord au niveau belge puis par la Communauté Européenne ... [more ▼]Il y a plus de 10 ans, le réseau LEARN-NETT naissait de la rencontre de professeurs en sciences de l’éducation et était financé pendant trois ans, d’abord au niveau belge puis par la Communauté Européenne. Leur préoccupation ? Outre la formation aux usages des TIC dans les pratiques de formation, oeuvrer à la qualité de la formation pédagogique des futurs enseignants en les rendant davantage capables de travailler en équipe (apprentissage de la collaboration à distance) et d’assurer leur propre développement professionnel. Un élément particulier ? Le réseau LEARN-NETT est toujours actif. Ce mini-colloque sera décliné en trois parties. (1) Le dispositif pédagogique LEARN-NETT : les lignes de forces restées stables depuis 10 ans et les aspects qui ont évolué en fonction des avancées technopédagogiques. (2) Une des valeurs ajoutées de ce dispositif : la formation des tuteurs. Comment les tuteurs apprennent-ils leur fonction, développent-ils leurs compétences dans ce dispositif ? (3) Les bénéfices pour les différents acteurs de LEARN-NETT (enseignantschercheurs, tuteurs …), les perspectives nouvelles liées aux développements pédagogiques et technologiques, les conditions de survie et de développement d’un tel réseau et l’impact institutionnel d’un tel projet comme catalyseur de l’innovation pédagogique. [less ▲]Detailed reference viewed: 43 (2 ULg) Le leasing financier en BelgiqueKohl, Benoît in Uniform Law Review = Revue de Droit Uniforme (2011), (1/2), 45-82Detailed reference viewed: 48 (6 ULg) Le leasing financier et son harmonisation par UnidroitKohl, Benoît in Dirix, Eric; Leleu, Yves-Henri (Eds.) Rapports belges au Congrès de l'Académie Internationale de droit comparé (2011)Detailed reference viewed: 18 (4 ULg) Le leasing immobilier - Aspects de droit privéKohl, Benoît ; Vanwijck, Michèle in Revue de Droit Immobilier (2000)Detailed reference viewed: 71 (5 ULg) Le leasing immobilierKohl, Benoît Scientific conference (2012, February)Detailed reference viewed: 51 (3 ULg) Leasing immobilier: panorama généralKohl, Benoît in Kohl, Benoît (Ed.) Le bail et le leasing immobilier. (2009)Detailed reference viewed: 100 (4 ULg) Least Construction Cost of FSO Offshore Structures and LNG Gas CarriersRigo, Philippe ; Matagne, Jérôme ; Caprace, Jean-David in ISOPE, The fifteenth International Offshore and Polar Engineering Conference, Seoul (2005, June 19)In this paper, scantling optimization a FSO offshore structure and a medium size capacity LNG gas carrier are presented. Optmization is based on the LBR5 least cost optimization package. Main originality ... [more ▼]In this paper, scantling optimization a FSO offshore structure and a medium size capacity LNG gas carrier are presented. Optmization is based on the LBR5 least cost optimization package. Main originality and advantage is to combine the minimization of the construction cost with the preliminary design stage. The optimum scantling (least cost) is determined at the earliest design stage, this means before the signature of the contract. Cost savings of 5 to 10% are currently recorded. Relevant information on the methodology and applications to a FSO unit and a LNG carrier are presented in the paper. [less ▲]Detailed reference viewed: 172 (27 ULg) Least Cost and Scantling Optimization at the initial Design Stage of ShipsRigo, Philippe ; Toderan, Catalinin ICETECH 2000 (2000, September)Detailed reference viewed: 31 (0 ULg) Least Cost Optimisation of a Medium Capacity Gas CarrierRigo, Philippe ; Toderan, C.in COMPIT’03, 2nd Int. EuroConference on Computer and IT Applications in the Maritime Industries,Hamburg, Ed. V. Bertram, 14-17 May 2003 (2003, May)Detailed reference viewed: 22 (0 ULg) Least cost optimization of a large passenger vesselRichir, Thomas; Losseau, Nicolas; Pircalabu, Eugen et alin International Conference on “Advancements in Marine Structures”, (Proceedings of MARSTRUCT’2007), Edt Guedes Soares & Das, Publ: Taylor & Francis Group, UK, 12-14 March 2007 (2007, March)Detailed reference viewed: 31 (0 ULg)