3446 search results - page 130 / 690 » A Reasoning Algorithm for pD* |
COLING
2002
15 years 1 months ago
2002
A bilingual concept MRD is of significance for IE, MT, WSD and the like. However, it is reasonably difficult to build such a lexicon for there exist two ontologies, also, the evol...
120
click to vote
JOC
2002
15 years 1 months ago
2002
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
140
click to vote
CLOUDCOM
2010
Springer
14 years 11 months ago
2010
Springer
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
245
click to vote
OL
2011
14 years 8 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
134
click to vote
SEMWEB
2010
Springer
14 years 11 months ago
2010
Springer
RDF(S) and OWL 2 currently support only static ontologies. In practice, however, the truth of statements often changes with time, and Semantic Web applications often need to repres...