Sciweavers

901 search results - page 140 / 181
» Analyzing linear mergers
Sort
View
CORR
2010
Springer
105views Education» more  CORR 2010»
14 years 9 months ago
Optimism in Reinforcement Learning Based on Kullback-Leibler Divergence
We consider model-based reinforcement learning in finite Markov Decision Processes (MDPs), focussing on so-called optimistic strategies. Optimism is usually implemented by carryin...
Sarah Filippi, Olivier Cappé, Aurelien Gari...
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 9 months ago
Approximate Judgement Aggregation
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
Ilan Nehama
ICASSP
2010
IEEE
14 years 9 months ago
A novel, fast, and complete 3D segmentation of vertebral bones
Bone mineral density (BMD) measurements and fracture analysis of the spine bones are restricted to the Vertebral bodies (VBs), especially the trabecular bones (TBs). In this paper...
Melih S. Aslan, Asem M. Ali, Ham Rara, Ben Arnold,...
IWSEC
2010
Springer
14 years 9 months ago
Optimal Adversary Behavior for the Serial Model of Financial Attack Trees
Abstract. Attack tree analysis is used to estimate different parameters of general security threats based on information available for atomic subthreats. We focus on estimating the...
Margus Niitsoo
MP
2010
145views more  MP 2010»
14 years 9 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...