248 search results - page 13 / 50 » The Relative Complexity of NP Search Problems |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word ha...
FCT
2007
Springer
13 years 11 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
The task of aligning sequences arises in many applications. Classical dynamic programming approaches require the explicit state enumeration in the reward model. This is often impr...
AAAI
1993
13 years 9 months ago
1993
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
ANNS
2010
13 years 2 months ago
2010
Evolving recurrent neural networks for behavior control of robots equipped with larger sets of sensors and actuators is difficult due to the large search spaces that come with the ...