699 search results - page 73 / 140 » The method of combinatorial telescoping |
153
Voted
SEW
2006
IEEE
15 years 11 months ago
2006
IEEE
Pseudo-exhaustive testing uses the empirical observation that, for broad classes of software, a fault is likely triggered by only a few variables interacting. The method takes adv...
140
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
132
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
157
Voted
ICOIN
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
125
Voted
WCC
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(pk ) by taking successive k-tuples of given sequences over GF(p). We are abl...