5316 search results - page 228 / 1064 » Which Search Problems Are Random |
117
Voted
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
It is well known that using high-locality representations is important for efficient evolutionary search. This paper discusses how the locality of a representation influences the ...
152
Voted
WWW
2010
ACM
15 years 8 months ago
2010
ACM
Realtime web search refers to the retrieval of very fresh content which is in high demand. An effective portal web search engine must support a variety of search needs, including ...
134
click to vote
CRYPTO
2000
Springer
15 years 9 months ago
2000
Springer
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
135
click to vote
EMNLP
2009
15 years 2 months ago
2009
We present an inexact search algorithm for the problem of predicting a two-layered dependency graph. The algorithm is based on a k-best version of the standard cubictime search al...
131
Voted
ANOR
2008
15 years 4 months ago
2008
Abstract We consider the problem of coordinating the operations of two supply chain partners: a foreign shipping company and a domestic port. The two partners have conflicting busi...