6167 search results - page 142 / 1234 » Can Refinement be Automated |
118
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
Determining the X-ray crystallographic structures of proteins using the technique of molecular replacement (MR) can be a time and labor-intensive trial-and-error process, involvin...
127
click to vote
UIST
1998
ACM
15 years 8 months ago
1998
ACM
Textual query languages based on Boolean logic are common amongst the search facilities of on-line information repositories. However, there is evidence to suggest that the syntact...
142
click to vote
AMT
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Consistent description and representation method of user interests are required for personalized Web applications. In this paper, we provide a formal definition and the &...
129
click to vote
JLP
2008
15 years 4 months ago
2008
models, used for specification, analysis and verification, usually describe sets of implementations by means of a refinement relation. In the branching time setting, implementatio...
146
click to vote
EUROMICRO
2009
IEEE
15 years 11 months ago
2009
IEEE
—We propose a software engineering process to aid the development of Dynamic Software Architectures (DSAs). This process is based on the sequential application of a number of for...