1068 search results - page 137 / 214 » On Space Bounded Server Algorithms |
CP
2000
Springer
14 years 8 days ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
NIPS
2001
13 years 9 months ago
2001
Abstract--Kernel-based algorithms such as support vector machines have achieved considerable success in various problems in batch setting, where all of the training data is availab...
ICGI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
MVA
1990
13 years 9 months ago
1990
This paper proposes a novel representation of the free space of mobile robot by distinct, non-overlapping regions called Edge Visibility Regions (EVRs). An algorithm to partition ...