999 search results - page 49 / 200 » Constraints in Non-Boolean Contexts |
169
click to vote
UML
2005
Springer
15 years 11 months ago
2005
Springer
Analysis and design by contract allows the definition of a formal agreement between a class and its clients, expressing each party’s rights and obligations. Contracts written in ...
189
click to vote
ICRA
2003
IEEE
15 years 11 months ago
2003
IEEE
— In this paper we present a novel method for robot path planning based on learning motion patterns. A motion pattern is defined as the path that results from applying a set of ...
167
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
153
click to vote
CDB
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
243
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...