5100 search results - page 824 / 1020 » The Linear Complexity of a Graph |
192
click to vote
INFORMATICALT
2007
15 years 6 months ago
2007
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
186
click to vote
TMI
2008
15 years 6 months ago
2008
Abstract-- In this paper, we propose a new method to construct graphical representations of cortical folding patterns by computing skeletons on triangulated cortical surfaces. In o...
191
click to vote
JPDC
2007
15 years 6 months ago
2007
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clus...
150
click to vote
KBS
2007
15 years 6 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
182
click to vote
ASE
1999
15 years 6 months ago
1999
Behaviour analysis should form an integral part of the software development process. This is particularly important in the design of concurrent and distributed systems, where comp...