Sciweavers

654 search results - page 92 / 131
» On the Approximation of Computing Evolutionary Trees
Sort
View
STACS
2010
Springer
15 years 4 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
PG
2007
IEEE
15 years 4 months ago
Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
Oskar Åkerlund, Mattias Unger, Rui Wang
ICML
2005
IEEE
15 years 10 months ago
Bayesian sparse sampling for on-line reward optimization
We present an efficient "sparse sampling" technique for approximating Bayes optimal decision making in reinforcement learning, addressing the well known exploration vers...
Tao Wang, Daniel J. Lizotte, Michael H. Bowling, D...
DATE
2002
IEEE
104views Hardware» more  DATE 2002»
15 years 2 months ago
Closed-Form Crosstalk Noise Metrics for Physical Design Applications
In this paper we present efficient closed-form formulas to estimate capacitive coupling-induced crosstalk noise for distributed RC coupling trees. The efficiency of our approach...
Lauren Hui Chen, Malgorzata Marek-Sadowska
AAAI
2004
14 years 11 months ago
Temperature Discovery Search
Temperature Discovery Search (TDS) is a new minimaxbased game tree search method designed to compute or approximate the temperature of a combinatorial game. TDS is based on the co...
Martin Müller 0003, Markus Enzenberger, Jonat...