Sciweavers

1456 search results - page 76 / 292
» Two Techniques to Improve Finite Model Search
Sort
View
AAAI
1996
13 years 9 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
NC
1998
143views Neural Networks» more  NC 1998»
13 years 9 months ago
Spotting Arabic Phonetic Features Using Modular Connectionist Architectures and a Rule-Based System
This paper reports the results of experiments in complex Arabic phonetic features identification using a rulebased system (SARPH) and modular connectionist architectures. The firs...
Sid-Ahmed Selouani, Jean Caelen
SIGIR
2008
ACM
13 years 7 months ago
Automatically identifying localizable queries
Personalization of web search results as a technique for improving user satisfaction has received notable attention in the research community over the past decade. Much of this wo...
Michael J. Welch, Junghoo Cho
TASE
2008
IEEE
13 years 7 months ago
Perspectives in Probabilistic Verification
Soon after the birth of the flourishing research area of model checking in the early eighties, researchers started to apply this technique to finite automata equipped with probabi...
Joost-Pieter Katoen
RIDE
2002
IEEE
14 years 24 days ago
Enhancive Index for Structured Document
Structured documents, especially the XML documents, are made up of a few logical components, such as title, sections, subsections and paragraphs. The components in each structured...
Xiaoling Wang, Ji-Rong Wen, Yisheng Dong, Wenyin L...