Sciweavers

4781 search results - page 464 / 957
» Complexity at large
Sort
View
188
Voted
CMSB
2006
Springer
15 years 10 months ago
Randomization and Feedback Properties of Directed Graphs Inspired by Gene Networks
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
M. Cosentino Lagomarsino, P. Jona, B. Bassetti
ETRICS
2006
15 years 10 months ago
Possibilistic Information Flow Control in MAKS and Action Refinement
Abstract. Formal methods emphasizes the need for a top-down approach when developing large reliable software systems. Refinements are map step by step abstract algebraic specificat...
Dieter Hutter
ACNS
2003
Springer
156views Cryptology» more  ACNS 2003»
15 years 10 months ago
An Efficient Tree-Based Group Key Agreement Using Bilinear Map
Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative application. One of the important challeng...
Sangwon Lee, Yongdae Kim, Kwangjo Kim, DaeHyun Ryu
ICS
2000
Tsinghua U.
15 years 10 months ago
A low-complexity issue logic
One of the main concerns in today's processor design is the issue logic. Instruction-level parallelism is usually favored by an out-of-order issue mechanism where instruction...
Ramon Canal, Antonio González
PPSN
2000
Springer
15 years 10 months ago
Interacting Trajectories in Design Space and Niche Space: A Philosopher Speculates About Evolution
Abstract. There are evolutionary trajectories in two different but related spaces, design space and niche space. Coevolution occurs in parallel trajectories in both spaces, with co...
Aaron Sloman