790 search results - page 50 / 158 » Subexponential Parameterized Algorithms |
136
Voted
IJRR
2000
15 years 2 months ago
2000
The inverse kinematics problem is formulated as a parameterized autonomous dynamical system problem, and respective analysis is carried out. It is shown that a singular point of w...
137
Voted
IFIP
2001
Springer
15 years 7 months ago
2001
Springer
: One of the most important problems in SOC platforms design is that of defining strategies for tuning the parameters of a parameterized system so as to obtain the Pareto-optimal s...
126
Voted
ASIACRYPT
2007
Springer
15 years 8 months ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
137
Voted
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
120
Voted
STOC
1997
ACM
15 years 6 months ago
1997
ACM
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...