Sciweavers

1923 search results - page 361 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
COGSR
2011
105views more  COGSR 2011»
14 years 4 months ago
Inductive rule learning on the knowledge level
We present an application of the analytical inductive programming system Igor to learning sets of recursive rules from positive experience. We propose that this approach can be us...
Ute Schmid, Emanuel Kitzelmann
100
Voted
DAC
2008
ACM
15 years 10 months ago
Specify-explore-refine (SER): from specification to implementation
Driven by increasing complexity and reliability demands, the Japanese Aerospace Exploration Agency (JAXA) in 2004 commissioned development of ELEGANT, a complete SpecC-based envir...
Andreas Gerstlauer, Junyu Peng, Dongwan Shin, Dani...
ICN
2009
Springer
15 years 4 months ago
Measuring Route Diversity in the Internet from Remote Vantage Points
Recent works on modeling the Internet topology [8, 9] have highlighted how the complexity of relationships between Autonomous Systems (ASes) can not be oversimplified without sac...
Andrea Di Menna, Tiziana Refice, Luca Cittadini, G...
GIS
2005
ACM
15 years 10 months ago
Contraflow network reconfiguration for evacuation planning: a summary of results
Contraflow, or lane reversal, is a way of increasing outbound capacity of a real network by reversing the direction of inbound roads during evacuations. The contraflow is consider...
Sangho Kim, Shashi Shekhar
ASIACRYPT
2007
Springer
15 years 3 months ago
Blind Identity-Based Encryption and Simulatable Oblivious Transfer
An extended abstract of this paper appears in Kaoru Kurosawa (Ed.): Advances in Cryptology ASIACRYPT 2007, volume 4833 of Lecture Notes in Computer Science, pages 265–282, Spring...
Matthew Green, Susan Hohenberger