Sciweavers

15033 search results - page 180 / 3007
» Complexity Theory and Algorithms
Sort
View
PCI
2001
Springer
15 years 8 months ago
Communicating X-Machines: From Theory to Practice
Formal modeling of complex systems is a non-trivial task, especially if a formal method does not facilitate separate development of the components of a system. This paper describes...
Petros Kefalas, George Eleftherakis, Evangelos Keh...
229
Voted
TOPLAS
2008
81views more  TOPLAS 2008»
15 years 4 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
ECIS
2004
15 years 5 months ago
Change management: the contribution of personal construct theory (PCT)
This paper explores the use of two complementary approaches, each stemming from Personal Construct Theory (PCT), to investigate the interdependence of organizations and informatio...
Laurence Brooks, Christopher J. Davis, Mark Lycett
110
Voted
CGF
2008
75views more  CGF 2008»
15 years 4 months ago
Extraction Of Feature Lines On Surface Meshes Based On Discrete Morse Theory
We present an approach for extracting extremal feature lines of scalar indicators on surface meshes, based on discrete Morse Theory. By computing initial Morse-Smale complexes of ...
Jan Sahner, Britta Weber, Steffen Prohaska, Hans L...
126
Voted
TALG
2008
97views more  TALG 2008»
15 years 4 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon