352 search results - page 40 / 71 » Proofs as Polynomials |
CPC
2006
14 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. ...
TARK
2009
Springer
15 years 4 months ago
2009
Springer
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
CP
2007
Springer
15 years 4 months ago
2007
Springer
The techniques for making decisions, i.e., branching, play a central role in complete methods for solving structured CSP instances. In practice, there are cases when SAT solvers be...
IPCO
1998
14 years 11 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
98
Voted
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In practical applications evaluating a fitness function is frequently subject to noise, i. e., the “true fitness” is disturbed by some random variations. Evolutiona...