Sciweavers

54 search results - page 7 / 11
» Single-Frontier Bidirectional Search
Sort
View
JWSR
2006
113views more  JWSR 2006»
13 years 7 months ago
Search Strategies for Automatic Web Service Composition
: We investigate architectural properties required for supporting automatic service composition. First, composable service architecture will be described, based on modeling Web ser...
Nikola Milanovic, Miroslaw Malek
KI
2008
Springer
13 years 7 months ago
Partial Symbolic Pattern Databases for Optimal Sequential Planning
Abstract. This paper investigates symbolic heuristic search with BDDs for solving domain-independent action planning problems cost-optimally. By distributimpact of operators that t...
Stefan Edelkamp, Peter Kissmann
EMNLP
2007
13 years 8 months ago
Incremental Dependency Parsing Using Online Learning
We describe an incremental parser that was trained to minimize cost over sentences rather than over individual parsing actions. This is an attempt to use the advantages of the two...
Richard Johansson, Pierre Nugues
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
14 years 8 months ago
BIDE: Efficient Mining of Frequent Closed Sequences
Previous studies have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent patterns but only the closed ones because the latter lea...
Jianyong Wang, Jiawei Han
ISPD
2009
ACM
126views Hardware» more  ISPD 2009»
14 years 1 months ago
A new algorithm for simultaneous gate sizing and threshold voltage assignment
Gate sizing and threshold voltage (Vt) assignment are popular techniques for circuit timing and power optimization. Existing methods, by and large, are either sensitivity-driven h...
Yifang Liu, Jiang Hu