Sciweavers

3052 search results - page 477 / 611
» Engineers Don't Search
Sort
View
C3S2E
2010
ACM
13 years 10 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire
LDTA
2010
13 years 9 months ago
Faster ambiguity detection by grammar filtering
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
H. J. S. Basten, Jurgen J. Vinju
ASE
2008
120views more  ASE 2008»
13 years 9 months ago
Requirements model generation to support requirements elicitation: the Secure Tropos experience
In the last years several efforts have been devoted by researchers in the Requirements Engineering community to the development of methodologies for supporting designers during req...
Nadzeya Kiyavitskaya, Nicola Zannone
ML
2000
ACM
244views Machine Learning» more  ML 2000»
13 years 9 months ago
Learnable Evolution Model: Evolutionary Processes Guided by Machine Learning
A new class of evolutionary computation processes is presented, called Learnable Evolution Model or LEM. In contrast to Darwinian-type evolution that relies on mutation, recombinat...
Ryszard S. Michalski
IJWET
2010
83views more  IJWET 2010»
13 years 7 months ago
Technically approaching the semantic web bottleneck
: After several years of research, the fundamental Semantic Web technologies have reached a high maturity level. Nevertheless, the average Web user has not yet taken advantage of t...
Nikolaos Konstantinou, Dimitrios-Emmanuel Spanos, ...