520 search results - page 40 / 104 » New Complexity Results for Classical Planning Benchmarks |
106
click to vote
IPPS
2009
IEEE
15 years 7 months ago
2009
IEEE
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...
108
Voted
AIPS
2008
15 years 2 months ago
2008
Many current heuristics for domain-independent planning, such as Bonet and Geffner's additive heuristic and Hoffmann and Nebel's FF heuristic, are based on delete relaxa...
108
Voted
MLDM
2007
Springer
15 years 6 months ago
2007
Springer
Transduction is an inference mechanism “from particular to particular”. Its application to classification tasks implies the use of both labeled (training) data and unlabeled (...
88
Voted
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
The accuracy of optical flow estimation algorithms has been improving steadily as evidenced by results on the Middlebury optical flow benchmark. The typical formulation, however...
118
Voted
ISMVL
2000
IEEE
15 years 5 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...