A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
Characterizations of Decomposable Dependency Models
1996
The Journal of Artificial Intelligence Research
This paper presents new characterizations of decomposable models in terms of independence relationships, which are obtained by adding a single axiom to the well-known set characterizing dependency models ...
Decomposable dependency models possess a number of interesting and useful properties. ...
I am particularly grateful to the reviewer who pointed out to me the existence of Lauritzen's characterization of chordal graphs. ...
doi:10.1613/jair.329
fatcat:obru4xr3zjd6raer7idivw73uu
Characterizations of Decomposable Dependency Models
[article]
1996
arXiv
pre-print
This paper presents new characterizations of decomposable models in terms of independence relationships, which are obtained by adding a single axiom to the well-known set characterizing dependency models ...
Decomposable dependency models possess a number of interesting and useful properties. ...
I am particularly grateful to the reviewer who pointed out to me the existence of Lauritzen's characterization of chordal graphs. ...
arXiv:cs/9612103v1
fatcat:6cqxwtbijvcarjvrcyljw6hf54
Research Note—Designing Promotion Ladders to Mitigate Turnover of IT Professionals
2016
Information systems research
We also offer an explanation for the observation that jobs characterized by boundary-spanning activities have higher turnover, and show that such jobs are more sensitive to the effect of likelihood of ...
We draw on tournament theory, which is primarily concerned with inducing effort in employees, to decompose promotability into two distinct constructs: the likelihood of promotion and benefit from promotion ...
This research was funded in part by the National Science Foundation [Grant SES-0527180]. ...
doi:10.1287/isre.2016.0652
fatcat:tcwjsjbtf5aona6cdewuevaosi
Technical note: Some structural results on acyclic supply chains
2010
Naval Research Logistics
We specify ways to decompose them. ...
Most interestingly, we identify conditions for the best dedicated stocking policy to outperform the best shared stocking policy, and for an acyclic supply chain to be decomposable into a simpler network ...
This research is supported in part by a Faculty Research Grant from Rutgers Business School-Newark and New Brunswick. ...
doi:10.1002/nav.20421
fatcat:tm4lbspe4nbdbnylppfgalmgam
CLiFF Notes: Research in the Language, Information and Computation Laboratory of the University of Pennsylvania
[article]
1995
arXiv
pre-print
Short abstracts by computational linguistics researchers at the University of Pennsylvania describing ongoing individual and joint projects. ...
This division into local reasoner and global planner reflects the demands noted above: first, it supports goal-directed diagnosis, in the sense that its attempt to characterize a patient's injuries is ...
semantically characterize each complement. ...
arXiv:cmp-lg/9506008v1
fatcat:aidgv3pdzvfatc7yjygdvthcjq
Data Mining in Schizophrenia Research — Preliminary Analysis
[chapter]
2002
Lecture Notes in Computer Science
The subjects are characterized by diagnosis, genotype, brain anatomy (MRI), laboratory tests on blood samples, and basic demographic data. ...
More importantly, we discuss a number of issues in selection of methods from the very large set of tools in data mining and statistics. 28 Stefan Arnborg et al. ...
Based on the strength of pairwise variable associations, decomposable graphical models were obtained from the data matrix. ...
doi:10.1007/3-540-45681-3_3
fatcat:uixwkvllurgvdkeptgep7et3j4
Technical Note—A Note on Relaxations of the Choice Network Revenue Management Dynamic Program
2016
Operations Research
Our results hold for any discrete-choice model and do not involve any asymptotic scaling. ...
is within a factor of 2. ...
In general, the tractability of the approximation methods depends on the underlying discrete-choice model. ...
doi:10.1287/opre.2015.1453
fatcat:ggvbgn54sbhwpe4ljv32wvfzr4
Technical Note—A Sampling-Based Approach to Appointment Scheduling
2012
Operations Research
We use the convexity and subdifferential of the objective function of the appointment scheduling problem to determine bounds on the number of independent samples required to obtain a provably near-optimal ...
We consider the problem of appointment scheduling with discrete random durations but under the more realistic assumption that the duration probability distributions are not known and only a set of independent ...
Note that S i and C i are random variables that depend on the appointment vector A, and the random duration vector p. ...
doi:10.1287/opre.1120.1053
fatcat:qhcqi5z4enblpj2u3fz667cvdi
Technical Note—Cost Formulas for Continuous Review Inventory Models with Fixed Delivery Lags
1983
Operations Research
In continuous review models with a fixed delivery lag T, the state of the system is conveniently described by the net inventory position = (inventory on hand) plus (outstanding orders), in spite of most ...
cost components depending on the actual inventory on hand. ...
IN CONTINUOUS review single-item inventory models, the stochastic demand is conveniently characterized by the renewal reward process (Xc, Yn); n = 1, 2, * * * 1. ...
doi:10.1287/opre.31.5.957
fatcat:5v6w4m3aorhrpn5zettqq5bh4e
Semi-supervised Multiple Classifier Systems: Background and Research Directions
[chapter]
2005
Lecture Notes in Computer Science
This paper's goal is to review the background results that can be exploited to promote research on semi-supervised multiple classifier systems, and to outline some future research directions. ...
In the five editions of MCS workshop, most of the papers have dealt with design methods and applications of supervised multiple classifier systems. ...
A special thank goes to Nina Hathaway and Nagi Rao for their friendly and precious help with the editing and revision of this manuscript. ...
doi:10.1007/11494683_1
fatcat:r4a7bnb4hjespkh7q5lp4iysau
A Note on the Estimation of Job Amenities and Labor Productivity
2015
Social Science Research Network
This note introduces a maximum likelihood estimator of the value of job amenities and labor productivity in a single matching market based on the observation of equilibrium matches and wages. ...
Our estimator is suited for applications to a wide range of assignment problems. JEL Classification: C35, C78, J31. ...
In the remainder of the paper, Equations (3.1)-(3.4) will characterize the model to estimate. 3.3. Parametrization. ...
doi:10.2139/ssrn.3004406
fatcat:qkczzmqgrfhkxoarqmz3vud4cy
Agent Environments for Multi-agent Systems – A Research Roadmap
[chapter]
2015
Lecture Notes in Computer Science
Ten years ago, researchers in multi-agent systems became more and more aware that agent systems consist of more than only agents. ...
for numerous follow up research efforts. ...
The Collaboration View models collaborations as reusable modules and shows how they are decomposed into reusable submodules (i.e., roles, interactions, and behaviors). ...
doi:10.1007/978-3-319-23850-0_1
fatcat:67eowoj5v5eoxaqhu4xhj6krym
Pattern-Based Design Research – An Iterative Research Method Balancing Rigor and Relevance
[chapter]
2013
Lecture Notes in Computer Science
We illustrate the applicability of PDR by presenting a research project from the area of enterprise architecture management. ...
This is often referred to as the rigor and relevance challenge of design science research. ...
, of problems that are characterized by asymmetric criteria. ...
doi:10.1007/978-3-642-38827-9_6
fatcat:gttflir46raatcwcmfdcaueoky
A Note on Analysts' Earnings Forecast Errors Distribution
2003
Social Science Research Network
This is important for researchers who rely on techniques that are sensitive to the distributional assumptions of analysts' forecast errors. ...
of small positive forecast errors (middle asymmetry). ...
The economic implications of those two asymmetries depend on the specific economic context and on the research method used. ...
doi:10.2139/ssrn.471322
fatcat:uo63qfaxc5cw5a5dtkwfvoqaem
Further Research on Node Based Bottleneck Improvement Problem for Multicut
[chapter]
2006
Lecture Notes in Computer Science
Theme: ECCO is the annual meeting of the EURO working group on combinatorial optimization. ECCO was started in 1987 by a group of leading experts in Operations Research and Management Science. ...
This conference gives researchers an opportunity to present their latest results and to discuss current developments and applications, besides stimulating future interactions between the members of this ...
Acknowlegements This work is partially supported by Spanish Ministry of Science and Technology Research Project DPI2001-2715-C02-02, from National Plan of Scientific Research and Technological Development ...
doi:10.1007/11816157_107
fatcat:xjdnf4kesrbczoh4ilvxxixqei
« Previous
Showing results 1 — 15 out of 227,125 results