1968 search results - page 117 / 394 » The Complexity of Valued Constraint Models |
128
click to vote
CADE
2010
Springer
15 years 2 months ago
2010
Springer
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
113
click to vote
ISCAS
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract– This paper presents an improved topological algorithm for device-level analog placement with symmetry constraints. Based on the exploration of symmetric-feasible sequen...
100
click to vote
DIS
2001
Springer
15 years 6 months ago
2001
Springer
In this paper we describe BR-4, a computational model of scienti c discovery in particle physics. The system incorporates operators for determining quantum values of known particle...
182
click to vote
CAISE
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. Flexibility and automatic learning are key aspects to support users in dynamic business environments such as value chains across SMEs or when organizing a large event. Pr...
159
click to vote
PODS
1999
ACM
15 years 5 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...