Sciweavers

3009 search results - page 361 / 602
» The Expressive Rate of Constraints
Sort
View
IUI
2004
ACM
16 years 3 days ago
Flexible re-engineering of web sites
Re-engineering transforms a final user interface into a logical representation that is manipulable enough to allow forward engineering to port a UI from one computing platform to ...
Laurent Bouillon, Jean Vanderdonckt, Kwok Chieu Ch...
HSNMC
2004
Springer
130views Multimedia» more  HSNMC 2004»
16 years 1 days ago
Benefits of Using Ontologies in the Management of High Speed Networks
Network management is an area where many different technologies coexist. Several languages are used to define the information to be managed, which are specific of each management m...
Jorge E. López de Vergara, Víctor A....
MOZ
2004
Springer
16 years 22 hour ago
The XDG Grammar Development Kit
Abstract. Extensible Dependency Grammar (XDG) is a graph description language whose formulas can be solved by constraint programming. XDG is designed so as to yield a declarative a...
Ralph Debusmann, Denys Duchier, Joachim Niehren
ICSM
2003
IEEE
15 years 12 months ago
On Modeling Software Architecture Recovery as Graph Matching
This paper presents a graph matching model for the software architecture recovery problem. Because of their expressiveness, the graphs have been widely used for representing both ...
Kamran Sartipi, Kostas Kontogiannis
ISSRE
2003
IEEE
15 years 12 months ago
Requirements by Contracts allow Automated System Testing
Use-cases and scenarios have been identified as good inputs to generate test cases and oracles at requirement level. Yet to have an automated generation, information is missing f...
Clémentine Nebut, Franck Fleurey, Yves Le T...