Sciweavers

1424 search results - page 64 / 285
» Improving on Version Stamps
Sort
View
IPCO
2008
105views Optimization» more  IPCO 2008»
15 years 16 days ago
Can Pure Cutting Plane Algorithms Work?
We discuss an implementation of the lexicographic version of Gomory's fractional cutting plane method and of two heuristics mimicking the latter. In computational testing on a...
Arrigo Zanette, Matteo Fischetti, Egon Balas
RE
2006
Springer
14 years 11 months ago
Using Domain Ontology as Domain Knowledge for Requirements Elicitation
Domain knowledge is one of crucial factors to get a great success in requirements elicitation of high quality, and only domain experts, not requirements analysts, have it. We prop...
Haruhiko Kaiya, Motoshi Saeki
DCC
2000
IEEE
14 years 11 months ago
Efficient Arithmetic on Koblitz Curves
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: ta...
Jerome A. Solinas
112
Voted
ISSRE
2010
IEEE
14 years 9 months ago
Change Bursts as Defect Predictors
—In software development, every change induces a risk. What happens if code changes again and again in some period of time? In an empirical study on Windows Vista, we found that ...
Nachiappan Nagappan, Andreas Zeller, Thomas Zimmer...
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
14 years 9 months ago
Parallel shared memory strategies for ant-based optimization algorithms
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
Thang Nguyen Bui, ThanhVu H. Nguyen, Joseph R. Riz...