8724 search results - page 300 / 1745 » Search result diversification |
156
click to vote
JAIR
2006
15 years 6 months ago
2006
We consider interactive tools that help users search for their most preferred item in a large collection of options. In particular, we examine example-critiquing, a technique for ...
174
click to vote
JAIR
2007
15 years 6 months ago
2007
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
178
click to vote
IJKESDP
2010
15 years 5 months ago
2010
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
193
click to vote
PPSN
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
149
click to vote
PTS
2010
15 years 5 months ago
2010
Recently there has been an upsurge of interest in both, Search– Based Software Testing (SBST), and Dynamic Symbolic Execution (DSE). Each of these two approaches has complementar...