10493 search results - page 41 / 2099 » Dynamic Word Problems |
ICONIP
2009
13 years 5 months ago
2009
It is generally assumed in the traditional formulation of supervised learning that only the outputs data are uncertain. However, this assumption might be too strong for some learni...
COLING
1996
13 years 9 months ago
1996
Two problematic issues in most lexicon systems today are their size and restricted domain of use. In this paper, we introduce a new approach to lexical organization that leads to ...
CADE
2012
Springer
11 years 10 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
How does a search engine company decide what ads to display with each query so as to maximize its revenue? This turns out to be a generalization of the online bipartite matching p...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Addressing dynamic optimization problems has attracted a growing interest from the evolutionary algorithm community in recent years due to its importance in the applications of...