1138 search results - page 187 / 228 » Parallel Implementation of Constraint Solving |
ITC
1998
IEEE
14 years 1 months ago
1998
IEEE
This paper presents a logic synthesis tool called BETSY (BIST Environment Testable Synthesis) for synthesizing circuits that achieve complete (100%)fault coverage in a user specif...
INFOCOM
1997
IEEE
14 years 1 months ago
1997
IEEE
— We present a new scheme that addresses the call handoff problem in mobile cellular networks. Efficiently solving the handoff problem is important for guaranteeing quality of s...
EVOW
2010
Springer
14 years 25 days ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
ANNPR
2006
Springer
14 years 17 days ago
2006
Springer
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
ECAI
2006
Springer
14 years 15 days ago
2006
Springer
Abstract. In this work a model for planning with multivalued fluents and graded actions, based on the infinite valued Lukasiewicz logic, is introduced. In multivalued planning, flu...