1376 search results - page 199 / 276 » Searching Trees: An Essay |
159
click to vote
ESSOS
2009
Springer
16 years 1 months ago
2009
Springer
In the search for metrics that can predict the presence of vulnerabilities early in the software life cycle, there may be some benefit to choosing metrics from the non-security rea...
162
click to vote
CIKM
2009
Springer
16 years 28 days ago
2009
Springer
We investigate the problem of determining the polarity of sentiments when one or more occurrences of a negation term such as “not” appear in a sentence. The concept of the sco...
159
click to vote
GECCO
2009
Springer
16 years 28 days ago
2009
Springer
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
169
click to vote
IWPEC
2009
Springer
16 years 27 days ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
196
click to vote
ICTAI
2008
IEEE
16 years 23 days ago
2008
IEEE
Unlike simple questions, complex questions cannot be answered by simply extracting named entities. These questions require inferencing and synthesizing information from multiple d...