Sciweavers

14649 search results - page 2895 / 2930
» Principles of problem solving
Sort
View
FUIN
2006
98views more  FUIN 2006»
13 years 8 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson
CC
2007
Springer
121views System Software» more  CC 2007»
13 years 8 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
INFSOF
2008
201views more  INFSOF 2008»
13 years 8 months ago
Motivation in Software Engineering: A systematic literature review
Objective: In this paper, we present a systematic literature review of motivation in Software Engineering. The objective of this review is to plot the landscape of current reporte...
Sarah Beecham, Nathan Baddoo, Tracy Hall, Hugh Rob...
ISCI
2008
130views more  ISCI 2008»
13 years 8 months ago
Unified eigen analysis on multivariate Gaussian based estimation of distribution algorithms
Multivariate Gaussian models are widely adopted in continuous Estimation of Distribution Algorithms (EDAs), and covariance matrix plays the essential role in guiding the evolution...
Weishan Dong, Xin Yao
IJFCS
2006
110views more  IJFCS 2006»
13 years 8 months ago
Sat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
Fang Yu, Bow-Yaw Wang
« Prev « First page 2895 / 2930 Last » Next »