Sciweavers

1639 search results - page 116 / 328
» Anytime Heuristic Search
Sort
View
CORR
2007
Springer
147views Education» more  CORR 2007»
13 years 10 months ago
Decomposition During Search for Propagation-Based Constraint Solvers
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Martin Mann, Guido Tack, Sebastian Will
JUCS
2000
91views more  JUCS 2000»
13 years 10 months ago
Syntax, Parsing and Production of Natural Language in a Framework of Information Compression by Multiple Alignment, Unification
This article introduces the idea that information compression by multiple alignment, unification and search (ICMAUS) provides a framework within which natural language syntax may ...
J. Gerard Wolff
CAD
1998
Springer
13 years 10 months ago
Knot-removal surface fairing using search strategies
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...
Stefanie Hahmann, Stefan Konz
ICCD
2001
IEEE
176views Hardware» more  ICCD 2001»
14 years 7 months ago
BDD Variable Ordering by Scatter Search
Reduced Ordered Binary Decision Diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions which are frequently used in VLSI Design Automation. ...
William N. N. Hung, Xiaoyu Song
ICC
2007
IEEE
14 years 4 months ago
Turbo Multiuser Detection Based on Local Search Algorithms
—The full-complexity soft-input/soft-output (SISO) multiuser detector based on the a posteriori probability (APP) algorithm has a computational complexity growing exponentially w...
Zhiliang Qin, Kui Cai, Xiaoxin Zou