Sciweavers

8025 search results - page 1045 / 1605
» Combinators Introduction: An Algorithm
Sort
View
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 8 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
184
Voted
WSC
2000
15 years 8 months ago
Variance reduction techniques for value-at-risk with heavy-tailed risk factors
The calculation of value-at-risk (VAR) for large portfolios of complex instruments is among the most demanding and widespread computational challenges facing the financial industr...
Paul Glasserman, Philip Heidelberger, Perwez Shaha...
AAAI
1996
15 years 8 months ago
Efficient Goal-Directed Exploration
If a state space is not completely known in advance, then search algorithms have to explore it sufficiently to locate a goal state and a path leading to it, performing therefore w...
Yury V. Smirnov, Sven Koenig, Manuela M. Veloso, R...
169
Voted
COLING
1996
15 years 8 months ago
A Statistical Method for Extracting Uninterrupted and Interrupted Collocations from Very Large Corpora
In order to extractrigidexpressions with a high frequency of use, new algorithm that can efficientlyextract both uninterruptedand interruptedcollocationsfrom very large corpora ha...
Satoru Ikehara, Satoshi Shirai, Hajime Uchino
NIPS
1994
15 years 8 months ago
Reinforcement Learning with Soft State Aggregation
It is widely accepted that the use of more compact representations than lookup tables is crucial to scaling reinforcement learning (RL) algorithms to real-world problems. Unfortun...
Satinder P. Singh, Tommi Jaakkola, Michael I. Jord...
« Prev « First page 1045 / 1605 Last » Next »