138 search results - page 22 / 28 » Finding an optimal tree searching strategy in linear time |
CP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
FC
2009
Springer
14 years 5 months ago
2009
Springer
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
NN
2000
Springer
13 years 10 months ago
2000
Springer
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
MOR
2008
13 years 10 months ago
2008
We consider a singular stochastic control problem, which is called the Monotone Follower Stochastic Control Problem and give sufficient conditions for the existence and uniqueness...