Results 291 to 300 of about 3,866,035 (337)
Some of the next articles are maybe not open access.
An adaptable parallel search of knowledge bases with beam search
[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track, 2003An online computer-supported expert system is described which is designed for searching complex knowledge bases. Searching is performed in parallel with beam search, so that only a limited number of specific features are examined on each level. Parameters for beam search are modified during application of the software package, so that self adapting ...
Brajak, Peter +3 more
openaire +2 more sources
Inference-Time Text-to-Video Alignment with Diffusion Latent Beam Search
arXiv.orgThe remarkable progress in text-to-video diffusion models enables the generation of photorealistic videos, although the content of these generated videos often includes unnatural movement or deformation, reverse playback, and motionless scenes. Recently,
Yuta Oshima +3 more
semanticscholar +1 more source
Deductive Beam Search: Decoding Deducible Rationale for Chain-of-Thought Reasoning
arXiv.orgRecent advancements have significantly augmented the reasoning capabilities of Large Language Models (LLMs) through various methodologies, especially chain-of-thought (CoT) reasoning.
Tinghui Zhu, Kai Zhang, Jian Xie, Yu Su
semanticscholar +1 more source
Creative Beam Search: LLM-as-a-Judge For Improving Response Generation
International Conference on Innovative Computing and Cloud ComputingLarge language models are revolutionizing several areas, including artificial creativity. However, the process of generation in machines profoundly diverges from that observed in humans.
Giorgio Franceschelli, Mirco Musolesi
semanticscholar +1 more source
Filtered beam search in scheduling†
International Journal of Production Research, 1988Beam search is a technique for searching decision trees, particularly where the solution space is vast. The technique involves systematically developing a small number of solutions in parallel so as to attempt to maximize the probability of finding a good solution with minimal search effort.
PENG SI OW, THOMAS E. MORTON
openaire +1 more source
Genetic beam search for gate matrix layout
IEE Proceedings - Computers and Digital Techniques, 1994'Inhis popci prc5ciiIs a iiouel inipleineiztafzoii of the Cti)(/ic Algol i/hin 111 coinbiizataon wath beam seaich Joi gale matiax layout. Thzs zs a permutatzon problem, JOT iul)zch Ihc trndztional geneiac crossover operator restills zi1 rqeizlzoii of gates, and therefore the GA as not applicable wzthout modzjicataon.
K. Shahookar +3 more
openaire +1 more source
Rectangle Search: An Anytime Beam Search
Proceedings of the AAAI Conference on Artificial IntelligenceAnytime heuristic search algorithms try to find a (potentially suboptimal) solution as quickly as possible and then work to find better and better solutions until an optimal solution is obtained or time is exhausted. The most widely-known anytime search algorithms are based on best-first search.
Sofia Lemons +3 more
openaire +1 more source
Electronic Search Beam Stabilization
IEEE Transactions on Aerospace and Electronic Systems, 1980Compensating for ship's motion (roll and pitch) is a problem fundamental to shipboard radars. The more traditional aproach has been to mechanically stabilize the antenna structure. The alternative approach of stabilizing only the antenna beam is far from being new conceptually, but is more realizable with today's technology.
openaire +1 more source
Acoustic pattern matching and beam searching
ICASSP '82. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005Dynamic programming (DP) has become a popular means of performing the necessary time warping in isolated word recognition. DP offers the advantage of always finding the optimal fit of a known reference pattern against an unknown input utterance. Unfortunately, DP has two major disadvantages: 1) The amount of data needed to store the known reference ...
K. Greer, B. Lowerre, L. Wilcox
openaire +1 more source
Language modelling for efficient beam-search
Computer Speech & Language, 1995Abstract This paper considers the problems of estimating bigram language models and of efficiently representing them by a finite state network, which can be employed by a hidden Markov model based, beam-search, continuous speech recognizer. A review of the best known bigram estimation techniques is given together with a description of the original ...
Federico, Marcello +3 more
openaire +2 more sources