230 search results - page 20 / 46 » Constraint Orbital Branching |
96
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
143
click to vote
ECAI
2008
Springer
15 years 3 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...
124
click to vote
FMOODS
2000
15 years 3 months ago
2000
This paper presents a logic, called BOTL (Object-Based Temporal Logic), that facilitates the specification of dynamic and static properties of object-based systems. The logic is ba...
205
Voted
AGP
2010
IEEE
15 years 7 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
119
click to vote
ICCD
2006
IEEE
15 years 10 months ago
2006
IEEE
— Accurate estimation of worst-case crosstalk effects is critical for a realistic estimation of the worst-case behavior of deep sub-micron circuits. Crosstalk analysis models usu...