397 search results - page 41 / 80 » Comparing Two Grammar-Based Generation Algorithms: A Case St... |
COMPUTER
1999
13 years 7 months ago
1999
Discovery of a network topology is a challenging task. Available algorithms that rely on simple hop-limited, traceroute-style probes give different performance in terms of the com...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
PDPTA
2007
13 years 9 months ago
2007
— This paper considers scheduling divisible workloads from multiple sources in linear networks of processors. We propose a two phase scheduling strategy (TPSS) to minimize the ov...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
There has been little attention to search based test data generation in the presence of pointer inputs and dynamic data structures, an area in which recent concolic methods have e...
CAGD
2007
13 years 7 months ago
2007
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...