279 search results - page 46 / 56 » Testing for Refinement in CSP |
109
click to vote
JDCTA
2008
14 years 11 months ago
2008
The research work is carried out to enhance the recognition accuracy of neural network with Phase Only Correlation (POC) and reduce the time required for POC by refining its input...
RE
2006
Springer
14 years 11 months ago
2006
Springer
We introduce a variability-intensive approach to goal decomposition that is tailored to support requirements identification for highly customizable software. The approach is based...
MTA
2007
14 years 11 months ago
2007
Interface toolkits in ordinary application areas let average programmers rapidly develop software resembling other standard applications. In contrast, toolkits for novel and perhap...
109
click to vote
PR
2008
14 years 11 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
107
click to vote
LICS
2010
IEEE
14 years 9 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...