627 search results - page 20 / 126 » Branched Polyhedral Systems |
ECSQARU
1997
Springer
14 years 23 days ago
1997
Springer
Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...
CP
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
FECS
2007
13 years 10 months ago
2007
Computing professionals are employed in so many different ways that it is difficult to even define the common foundation that all of them should master; however, a single degree ...
CGF
2007
13 years 8 months ago
2007
We introduce an algorithm for the automatic computation of global parameterizations on arbitrary simplicial 2manifolds, whose parameter lines are guided by a given frame field, f...
KBSE
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such sys...