Sciweavers

1943 search results - page 133 / 389
» Ordering Default Theories
Sort
View
188
Voted
COMPLEXITY
2010
124views more  COMPLEXITY 2010»
15 years 4 months ago
Spatially embedded dynamics and complexity
To gain a deeper understanding of the impact of spatial embedding on the dynamics of complex systems we employ a measure of interaction complexity developed within neuroscience us...
Christopher L. Buckley, Seth Bullock, Lionel Barne...
205
Voted
APN
2009
Springer
16 years 1 months ago
Hasse Diagram Generators and Petri Nets
In [LJ06] Lorenz and Juh´as raised the question of whether there exists a suitable formalism for the representation of infinite families of partial orders generated by Petri nets...
Mateus de Oliveira Oliveira
QSHINE
2009
IEEE
16 years 1 months ago
Integration of OMF-Based Testbeds in a Global-Scale Networking Facility
PlanetLab is a global scale platform for experimentation of new networking applications in a real environment. It consists of several nodes, offered by academic institutions or co...
Giovanni Di Stasi, Stefano Avallone, Roberto Canon...
158
Voted
ATAL
2005
Springer
16 years 13 days ago
On possibilistic case-based reasoning for selecting partners for multi-attribute agent negotiation
We propose an enhanced mechanism for selecting partners for multi-attribute negotiation. The mechanism employs possibilistic case-based reasoning. The possibility of successful ne...
Jakub Brzostowski, Ryszard Kowalczyk
FSTTCS
2003
Springer
16 years 5 days ago
Moderately Hard Functions: From Complexity to Spam Fighting
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
Moni Naor