Sciweavers

1795 search results - page 92 / 359
» Search by strategy
Sort
View
EVOW
2007
Springer
16 years 15 days ago
A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
Christian Blum, Carlos Cotta, Antonio J. Fern&aacu...
COLING
2000
15 years 7 months ago
Backward Beam Search Algorithm for Dependency Analysis of Japanese
Backward beam search for dependency analysis of Japanese is proposed. As dependencies normally go from left to right in Japanese, it is effective to analyze sentences backwards (f...
Satoshi Sekine, Kiyotaka Uchimoto, Hitoshi Isahara
JAIR
2000
94views more  JAIR 2000»
15 years 6 months ago
Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
Subbarao Kambhampati
IAT
2009
IEEE
16 years 1 months ago
Bilateral Bargaining with One-Sided Two-Type Uncertainty
It is a challenging problem to find agents’ rational strategies in bargaining with incomplete information. In this paper we perform a game theoretic analysis of agents’ ratio...
Bo An, Nicola Gatti, Victor R. Lesser
ISBI
2002
IEEE
16 years 7 months ago
Pyramidal search of maximum coherence direction for biomedical image interpolation
A multiresolution technique for biomedical image interpolation is presented in this paper. It is an extension of the work on Directional Coherence Interpolation (DCI) [15] ? a nov...
Jingdan Zhang, Yongmei Wang, Baining Guo