5316 search results - page 108 / 1064 » Which Search Problems Are Random |
156
click to vote
ISCI
2010
15 years 1 months ago
2010
A random set can be regarded as the result of the imprecise observation of a random variable. Following this interpretation, we study to which extent the upper and lower probabili...
145
Voted
TSE
2010
15 years 1 months ago
2010
Search based optimization techniques have been applied to structural software test data generation since 1992, with a recent upsurge in interest and activity within this area. How...
123
click to vote
WEBI
2005
Springer
15 years 8 months ago
2005
Springer
The most well known search techniques are perhaps the PageRank and HITS algorithms. In this paper we argue that these algorithms miss an important dimension, the temporal dimensio...
126
click to vote
JAIR
2007
15 years 3 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
112
Voted
AE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. How has a stack of n blocks to be arranged in order to maximize its overhang over a table edge while being stable? This question can be seen as an example application for...