Sciweavers

851 search results - page 100 / 171
» Inaccessibility in Decision Procedures
Sort
View
DATE
2002
IEEE
113views Hardware» more  DATE 2002»
14 years 2 months ago
BerkMin: A Fast and Robust Sat-Solver
We describe a SAT-solver, BerkMin, that inherits such features of GRASP, SATO, and Chaff as clause recording, fast BCP, restarts, and conflict clause “aging”. At the same time...
Evguenii I. Goldberg, Yakov Novikov
MLDM
2009
Springer
14 years 1 months ago
Selection of Subsets of Ordered Features in Machine Learning
The new approach of relevant feature selection in machine learning is proposed for the case of ordered features. Feature selection and regularization of decision rule are combined ...
Oleg Seredin, Andrey Kopylov, Vadim Mottl
EPIA
2001
Springer
14 years 1 months ago
Global Hull Consistency with Local Search for Continuous Constraint Solving
This paper addresses constraint solving over continuous domains in the context of decision making, and discusses the trade-off between precision in the definition of the solution s...
Jorge Cruz, Pedro Barahona
ER
2001
Springer
96views Database» more  ER 2001»
14 years 1 months ago
Process Patterns to Generate E-commerce Systems
: In electronic commerce, two fundamental types of models are business models and process models. While a business model is concerned with value exchanges between actors, a process...
Prasad Jayaweera, Paul Johannesson, Petia Wohed
TACAS
2001
Springer
92views Algorithms» more  TACAS 2001»
14 years 1 months ago
Language Containment Checking with Nondeterministic BDDs
Abstract. Checking for language containment between nondeterministic ω-automata is a central task in automata-based hierarchical verification. We present a symbolic procedure for...
Bernd Finkbeiner