5316 search results - page 94 / 1064 » Which Search Problems Are Random |
110
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We evaluate the performance of FPT algorithms for the directed feedback vertex set problem (DFVS). We propose several new data reduction rules for DFVS. which can signi...
128
click to vote
SARA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
141
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
100
click to vote
EOR
2006
15 years 3 months ago
2006
We consider multi-period portfolio selection problems for a decision maker with a specified utility function when the variance of security returns is described by a discrete time ...
105
click to vote
SIGIR
2009
ACM
15 years 9 months ago
2009
ACM
Topics form a crucial component of a test collection. We show, through visualization, that the INEX 2008 topics have shortcomings, which questions their validity for evaluating XM...