5316 search results - page 275 / 1064 » Which Search Problems Are Random |
144
Voted
AIPS
2006
15 years 6 months ago
2006
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
135
click to vote
INFORMS
2000
15 years 4 months ago
2000
We develop a variant of the Nelder-Mead (NM) simplex search procedure for stochastic simulation optimization that is designed to avoid many of the weaknesses encumbering such dire...
184
click to vote
ASIACRYPT
2011
Springer
14 years 5 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
159
click to vote
IEICET
2010
15 years 2 months ago
2010
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
142
click to vote
DASFAA
2009
IEEE
15 years 12 months ago
2009
IEEE
Recently, due to its wide applications, (similar) subgraph search has attracted a lot of attentions from database and data mining community, such as [13, 18, 19, 5]. In [8], Ke et ...