Results 1  10
of
3,717
A Multiagent Approach for Space Occupation Problems
"... The occupation of space is a recurring problem in many areas for constraint satisfaction and optimization. The used approaches tend to privilege the optimization or the satisfaction without leading to a general solution. In spite of the success of the few methods of space occupation problems, it can ..."
Abstract
 Add to MetaCart
The occupation of space is a recurring problem in many areas for constraint satisfaction and optimization. The used approaches tend to privilege the optimization or the satisfaction without leading to a general solution. In spite of the success of the few methods of space occupation problems
Refined Large Deviation Asymptotics for the Classical Occupancy Problem
, 2005
"... In this paper refined large deviation asymptotics are derived for the classical occupancy problem. The asymptotics are established for a sequential filling experiment and an occupancy experiment. In the first case the random variable of interest is the number of balls required to fill a given fracti ..."
Abstract
 Add to MetaCart
In this paper refined large deviation asymptotics are derived for the classical occupancy problem. The asymptotics are established for a sequential filling experiment and an occupancy experiment. In the first case the random variable of interest is the number of balls required to fill a given
Large Deviation Principle for Occupancy Problems with Colored Balls
, 2003
"... A Large Deviations Principle (LDP), demonstrated for occupancy problems with indistinguishable balls, is generalized to the case in which balls may be distinguished by a finite number of colors. The colors of the balls are chosen independently from the occupancy process itself. There are r balls th ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A Large Deviations Principle (LDP), demonstrated for occupancy problems with indistinguishable balls, is generalized to the case in which balls may be distinguished by a finite number of colors. The colors of the balls are chosen independently from the occupancy process itself. There are r balls
Application of the Weka Machine Learning Library to Hospital Ward Occupancy Problems
, 2007
"... We explore the potential of applying machine learning techniques to the management of patient flow in hospitals. For this project, we have obtained the Weka machine learning library and three years of historical ward occupancy data from Rockyview Hospital. We use Weka’s classifier algorithms and the ..."
Abstract
 Add to MetaCart
and the Rockyview data to build a model of patient flow through each ward. Using Weka, we then attempt to predict ward occupancy problems on any given day using the model and the ward conditions from the previous day. This process is repeated for all eighteen wards. Finally, we obtain rules (sets of ward conditions
Application of the Occupancy Problem to Wireless Local Area Network Establishments
, 2000
"... This paper describes the new application of the classical occupancy problem to the establishments of ad hoc wireless local area networks. A contentionbased algorithm called uniform for network setups is introduced in this paper. The major evaluation criterion for this algorithm is the contenti ..."
Abstract
 Add to MetaCart
This paper describes the new application of the classical occupancy problem to the establishments of ad hoc wireless local area networks. A contentionbased algorithm called uniform for network setups is introduced in this paper. The major evaluation criterion for this algorithm
Analytic Analysis of Algorithms
, 1992
"... . The average case analysis of algorithms can avail itself of the development of synthetic methods in combinatorial enumerations and in asymptotic analysis. Symbolic methods in combinatorial analysis permit to express directly the counting generating functions of wide classes of combinatorial struct ..."
Abstract

Cited by 331 (13 self)
 Add to MetaCart
are presented. The range of applications includes formal languages, tree enumerations, comparisonbased searching and sorting, digital structures, hashing and occupancy problems. These analytic approaches allow an abstract discussion of asymptotic properties of combinatorial structures and schemas while
The effects of cognitive and noncognitive abilities on labor market outcomes and social behavior
 Journal of Labor Economics
, 2006
"... William Johnson and James P. Ziliak and two anonymous referees for helpful comments. We also thank Jeff Grogger, Bruce Meyer and Derek Neal for very helpful comments that led to revisions and clarifications. Supplementary materials are on our website jenni.uchicago.edu/noncog. We thank Federico Teme ..."
Abstract

Cited by 370 (46 self)
 Add to MetaCart
important. Our analysis addresses the problems of measurement error, imperfect proxies, and reverse causality that plague conventional studies of cognitive and noncognitive skills that regress earnings (and other outcomes) on proxies for skills. Noncognitive skills strongly influence schooling decisions
Markov Localization for Mobile Robots in Dynamic Environments
 Journal of Artificial Intelligence Research
, 1999
"... Localization, that is the estimation of a robot's location from sensor data, is a fundamental problem in mobile robotics. This papers presents a version of Markov localization which provides accurate position estimates and which is tailored towards dynamic environments. The key idea of Marko ..."
Abstract

Cited by 361 (45 self)
 Add to MetaCart
Localization, that is the estimation of a robot's location from sensor data, is a fundamental problem in mobile robotics. This papers presents a version of Markov localization which provides accurate position estimates and which is tailored towards dynamic environments. The key idea
Competition between Discrete Random Variables, with Applications to Occupancy Problems
, 2008
"... Consider n players whose “scores ” are independent and identically distributed values {Xi} n i=1 from some discrete distribution F. We pay special attention to the cases where (i) F is geometric with parameter p → 0 and (ii) F is uniform on {1,2,...,N}; the latter case clearly corresponds to the cla ..."
Abstract
 Add to MetaCart
to the classical occupancy problem. The quantities of interest to us are, first, the Ustatistic W which counts the number of “ties” between pairs i,j; second, the univariate statistic Yr, which counts the number of strict rway ties between contestants, i.e., episodes of the 1 form Xi1 = Xi2 =... = Xir; Xj = Xi1
Results 1  10
of
3,717