13376 search results - page 152 / 2676 » Problem Solving with |
119
click to vote
PDCAT
2005
Springer
15 years 8 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
108
click to vote
ICCS
2003
Springer
15 years 8 months ago
2003
Springer
: We present a maple-package SyNRAC for solving real algebraic constraints aiming to realize a robust parametric control toolbox on MATLAB. Our main tool is real quantifier elimin...
125
click to vote
FLAIRS
2007
15 years 5 months ago
2007
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
137
click to vote
DATESO
2007
15 years 4 months ago
2007
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
128
click to vote
DCC
2008
IEEE
16 years 2 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...