5316 search results - page 261 / 1064 » Which Search Problems Are Random |
153
Voted
EMO
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. The classic NFL theorems are invariably cast in terms of single objective optimization problems. We confirm that the classic NFL theorem holds for general multiobjective ...
116
click to vote
WSC
2008
15 years 7 months ago
2008
Maritime terminals of pure transhipment are emerging logistic realities in long-distance containerized trade. Here, complex activities of resource allocation and scheduling should...
144
Voted
COGSR
2011
14 years 12 months ago
2011
In bandit problems, a decision-maker must choose between a set of alternatives, each of which has a fixed but unknown rate of reward, to maximize their total number of rewards ov...
153
click to vote
STTT
2010
14 years 11 months ago
2010
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
120
click to vote
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining Ò data values in the first Ò locatio...