1696 search results - page 87 / 340 » Permuted function matching |
WSC
2004
14 years 11 months ago
2004
We review the basic principles of Quasi-Monte Carlo (QMC) methods, the randomizations that turn them into variancereduction techniques, and the main classes of constructions under...
ACL
1998
14 years 11 months ago
1998
After extracting terms from a corpus of titles and s in English, syntactic variation relations are identified amongst them in order to detect research topics. Three types of synta...
98
Voted
AI
2010
Springer
14 years 10 months ago
2010
Springer
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
104
click to vote
DEXAW
2006
IEEE
15 years 4 months ago
2006
IEEE
: Scalable Distributed Data Structures (SDDSs) store large scalable files over a distributed RAM of nodes in a grid or a P2P network. The files scale transparently for the applicat...
EVOW
2008
Springer
15 years 4 days ago
2008
Springer
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...