116 search results - page 21 / 24 » Near optimal online algorithms and fast approximation algori... |
PPSN
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
IWANN
1999
Springer
13 years 11 months ago
1999
Springer
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
DFT
2003
IEEE
14 years 24 days ago
2003
IEEE
1 This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approa...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Display ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each ti...
FOCS
1995
IEEE
13 years 11 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...