2899 search results - page 52 / 580 » Dynamic Trees in Practice |
BIOADIT
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
CP
2000
Springer
14 years 1 months ago
2000
Springer
Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the proble...
PKDD
2007
Springer
14 years 3 months ago
2007
Springer
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
SCL
2008
13 years 8 months ago
2008
We introduce a new class of dynamic encoders for continuous-time nonlinear control systems which update their parameters only at discrete times. We prove that the information reco...
ISPD
2000
ACM
14 years 1 months ago
2000
ACM
In this paper, we present an algorithm for delay minimization of interconnect trees by simultaneous buffer insertion/sizing and wire sizing. The algorithm integrates the quadratic...