2244 search results - page 161 / 449 » A new heuristic approach for non-convex optimization problem... |
193
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
236
click to vote
SIGIR
2012
ACM
13 years 9 months ago
2012
ACM
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
175
click to vote
COMPSAC
2006
IEEE
16 years 1 months ago
2006
IEEE
As software systems evolve by adding new extensions some unexpected conflicts may occur, which is known as the Feature Interaction Problem (FIP). FIP is a threat to the dependabil...
184
click to vote
AAAI
1993
15 years 8 months ago
1993
Automating the construction of semantic grammars is a di cult and interesting problem for machine learning. This paper shows how the semantic-grammar acquisition problem can be vi...
190
click to vote
MOR
2010
15 years 5 months ago
2010
In this paper we study the problem of bounding the value of the probability distribution function of a random variable X at E[X] + a where a is a small quantity in comparison with...