1984 search results - page 19 / 397 » The colourful feasibility problem |
RTCSA
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper addresses the problem of scheduling real-time jobs that have multiple feasible intervals. The problem is NP-hard. We present an optimal branch-and-bound algorithm. When...
OL
2010
13 years 8 months ago
2010
We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1, . . . , m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the funct...
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
The colour of colon tissue, which depends on the tissue structure, its optical properties, and the quantities of the pigments present in it, can be predicted by a physics-based mod...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Software testing is a critical element of software quality assurance and represents the ultimate review of specification, design and coding. Software testing is the process of tes...
CPC
2006
13 years 10 months ago
2006
Motivated by a scheduling problem that arises in the study of optical networks we prove the following result, which is a variation of a conjecture of Haxell, Wilfong and Winkler. ...