3680 search results - page 104 / 736 » cases 2010 |
125
click to vote
ORL
2010
15 years 4 months ago
2010
Interval-gradient cuts are (nonlinear) valid inequalities for nonconvex NLPs defined for constraints g(x) ≤ 0 with g being continuously differentiable in a box [x, ¯x]. In th...
155
click to vote
SEAL
2010
Springer
15 years 4 months ago
2010
Springer
During engineering design, it is often difficult to quantify product reliability because of insufficient data or information for modeling the uncertainties. In such cases, one need...
185
click to vote
ASIACRYPT
2010
Springer
15 years 4 months ago
2010
Springer
We design cryptographic protocols that recognize best case (optimistic) situations and exploit them. As a case study, we present a new concurrent zeroknowledge protocol that is exp...
175
click to vote
CG
2010
Springer
15 years 4 months ago
2010
Springer
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It ...
171
click to vote
DATESO
2010
15 years 4 months ago
2010
Abstract. Current XPath processors use direct approach to query evaluation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case ...