1041 search results - page 12 / 209 » Randomizing Reductions of Search Problems |
AAAI
2007
13 years 10 months ago
2007
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
ICDCS
1999
IEEE
13 years 12 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
ESA
2009
Springer
14 years 2 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ï¬...
AI
2005
Springer
14 years 1 months ago
2005
Springer
In this research, a systematic study is conducted of four dimension reduction techniques for the text clustering problem, using five benchmark data sets. Of the four methods -- Ind...
ISCC
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....