Sciweavers

3946 search results - page 6 / 790
» The computational complexity of choice sets
Sort
View
COMPGEOM
2001
ACM
14 years 5 days ago
A practical approach for computing the diameter of a point set
We present an approximation algorithm for computing the diameter of a point-set in d-dimensions. The new algorithm is sensitive to the "hardness" of computing the diamet...
Sariel Har-Peled
ACG
2009
Springer
14 years 3 months ago
Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess
Evaluating agents in decision-making applications requires assessing their skill and predicting their behaviour. Both are well developed in Poker-like situations, but less so in mo...
Guy Haworth, Kenneth W. Regan, Giuseppe Di Fatta
COMPLEX
2009
Springer
14 years 3 months ago
Retail Location Choice with Complementary Goods: An Agent-Based Model
This paper examines the emergence of retail clusters on a supply chain network comprised of suppliers, retailers, and consumers. An agent-based model is proposed to investigate ret...
Arthur Huang, David Levinson
ENTCS
2008
102views more  ENTCS 2008»
13 years 8 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
CVPR
2007
IEEE
14 years 10 months ago
Statistical Shape Analysis of Multi-Object Complexes
An important goal of statistical shape analysis is the discrimination between populations of objects, exploring group differences in morphology not explained by standard volumetri...
Kevin Gorczowski, Martin Styner, Ja-Yeon Jeong, J....