843 search results - page 35 / 169 » Introducing the Iteration in sPBC |
162
click to vote
CAV
2007
Springer
16 years 6 days ago
2007
Springer
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
144
click to vote
MICAI
2007
Springer
16 years 5 days ago
2007
Springer
In this paper some results are obtained regarding the existence and reachability of minimal fixed points for multiple-valued functions on a multilattice. The concept of inf-preser...
154
click to vote
PPAM
2007
Springer
16 years 4 days ago
2007
Springer
The concept of a partial derangement is introduced and a versatile representation of partial derangements is proposed with permutations and derangements as special cases. The repre...
157
click to vote
SARA
2007
Springer
16 years 4 days ago
2007
Springer
One approach to optimal planning is to first start with a sub- optimal solution as a seed plan, and then iteratively search for shorter plans. This approach inevitably leads to an...
137
click to vote
ICMCS
2005
IEEE
15 years 11 months ago
2005
IEEE
A new, area-based mesh simplification algorithm is described. The proposed algorithm removes the center vertex of a polygon which consists of n ≥ 3 faces and represents that po...