9425 search results - page 1664 / 1885 » Some Notes on Models and Modelling |
139
Voted
STOC
2006
ACM
16 years 4 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
145
Voted
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
140
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
131
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
139
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...