6894 search results - page 958 / 1379 » Generation Problems |
176
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
197
click to vote
EDBT
2010
ACM
16 years 1 months ago
2010
ACM
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages or XML data schemas, the ambigui...
233
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
200
click to vote
LCTRTS
2009
Springer
16 years 1 months ago
2009
Springer
Register file (RF) is extremely vulnerable to soft errors, and traditional redundancy based schemes to protect the RF are prohibitive not only because RF is often in the timing c...
176
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we present efficient solutions for planning motions of dual-arm manipulation and re-grasping tasks. Motion planning for such tasks on humanoid robots with a hig...