3415 search results - page 181 / 683 » Lower Bounds for Kernelizations |
126
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
141
click to vote
NIPS
1998
15 years 6 months ago
1998
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...
132
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
— Recently, it has been shown that the max flow capacity can be achieved in a multicast network using network coding. In this paper, we propose and analyze a more realistic mode...
144
click to vote
SAT
2005
Springer
15 years 10 months ago
2005
Springer
We tackle the problem of finding a smallest-cardinality MUS (SMUS) of a given formula. The SMUS provides a succinct explanation of infeasibility and is valuable for applications th...
127
click to vote
ICRA
2000
IEEE
15 years 9 months ago
2000
IEEE
W'e consider the kinematic model of a vehicle moving forward with a lower bounded turning radius. This model, is relevant to describe the kinematics of road vehicles as well ...