986 search results - page 38 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
ANOR
2008
13 years 7 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
COCO
2001
Springer
14 years 5 days ago
2001
Springer
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...