3680 search results - page 135 / 736 » cases 2010 |
411
click to vote
ANTS
2010
Springer
15 years 10 months ago
2010
Springer
: We establish a conjecture of Brizolis that for every prime p > 3 there is a primitive root r and an integer t in the interval [1, p − 1] with logr t = t. Here, logr is the d...
153
click to vote
ENTCS
2007
15 years 6 months ago
2007
We address the problem of verifying planning domains as used in model-based planning, for example in space missions. We propose a methodology for testing flight rules of planning...
208
click to vote
TAICPART
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract. With pairwise testing, the test model is a list of N parameters. Each test case is an N-tuple; the test space is the cross product of the N parameters. A pairwise test is...
174
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
161
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...