60 search results - page 7 / 12 » On conjugate points and the Leitmann equivalent problem appr... |
EJC
2008
13 years 7 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
Optimizing nested queries is an intricate problem. It becomes even harder if in a nested query the linking predicate or the correlation predicate occurs disjunctively. We present ...
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper addresses the problem of selecting contact locations for grasping objects in the presence of shape and contact location uncertainty. Focusing on two-dimensional plan...
PIMRC
2008
IEEE
14 years 1 months ago
2008
IEEE
— We consider the problem of rate allocation in a fading Gaussian multiple-access channel with fixed transmission powers. The goal is to maximize a general concave utility funct...
HOTSWUP
2009
ACM
13 years 11 months ago
2009
ACM
Recent years have seen significant advances in dynamic software updating (DSU) systems, which allow programs to be patched on the fly. However, a significant challenge remains: Ho...