1208 search results - page 128 / 242 » Uniform eventown problems |
ALT
1997
Springer
15 years 2 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
102
click to vote
FSTTCS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We study the synthesis problem for external linear or branching specifications and distributed, synchronous architectures with arbitrary delays on processes. External mea...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
NIPS
2007
14 years 11 months ago
2007
When we have several related tasks, solving them simultaneously is shown to be more effective than solving them individually. This approach is called multi-task learning (MTL) and...
AAAI
2006
14 years 11 months ago
2006
Reasoning with both probabilistic and deterministic dependencies is important for many real-world problems, and in particular for the emerging field of statistical relational lear...