Sciweavers

1494 search results - page 70 / 299
» Less Extreme Programming
Sort
View
106
Voted
ICEGOV
2007
ACM
15 years 6 months ago
Analysis of popular open source licenses and their applicability to e-governance
The paper analyses existing open source licenses with the aim of choosing a license that is suitable for e-Governance projects. A method is presented for systematically choosing t...
Jaijit Bhattacharya, Sourabh Suman
CODAS
1996
63views more  CODAS 1996»
15 years 3 months ago
Semantic Modeling of Successive Events Applied to Version Management
ntic abstractions classification, aggregation and generalization are extremely useful for modeling complex situations containing time-independent events. This paper shows that the...
J. H. ter Bekke
130
Voted
CORR
2008
Springer
150views Education» more  CORR 2008»
15 years 2 months ago
Message-passing for Maximum Weight Independent Set
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky
97
Voted
AGP
2003
IEEE
15 years 7 months ago
An Evolving Agent with EVOLP
Abstract. Logic programming has often been considered less than adequate for modelling the dynamics of knowledge changing over time. Evolving Logic Programs (EVOLP) has been recent...
José Júlio Alferes, Antonio Brogi, J...
NJC
2006
88views more  NJC 2006»
15 years 2 months ago
Optimizing Slicing of Formal Specifications by Deductive Verification
Slicing is a technique for extracting parts of programs or specifications with respect to certain criteria of interest. The extraction is carried out in such a way that properties ...
Ingo Brückner, Björn Metzler, Heike Wehr...