1645 search results - page 177 / 329 » Rationale-Based Use Case Specification |
181
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
This work addresses conceptual modeling and automatic code generation for Rich Internet Applications, a variant of Web-based systems bridging the gap between desktop and Web inter...
186
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
A Web Application must have a precise semantics. In currently Web Engineering environments, this can be achieved either by specifying a Web Conceptual Schema, or by using a Semant...
211
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
179
click to vote
ESOP
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. This paper is concerned with testing properties of polymorphic functions. The problem is that testing can only be performed on specific monomorphic instances, whereas par...
171
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...