Sciweavers

1411 search results - page 214 / 283
» A Value Analysis for C Programs
Sort
View
JGAA
2000
85views more  JGAA 2000»
13 years 8 months ago
Techniques for the Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
TSE
2002
99views more  TSE 2002»
13 years 8 months ago
Recovering Traceability Links between Code and Documentation
Software system documentation is almost always expressed informally in natural language and free text. Examples include requirement specifications, design documents, manual pages, ...
Giuliano Antoniol, Gerardo Canfora, Gerardo Casazz...
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen
ICST
2008
IEEE
14 years 3 months ago
Verifying and Analyzing Adaptive Logic through UML State Models
It is becoming increasingly important to be able to adapt an application’s behavior at run time in response to changing requirements and environmental conditions. Adaptive progr...
Andres J. Ramirez, Betty H. C. Cheng
GD
1998
Springer
14 years 1 months ago
Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....