Sciweavers

2373 search results - page 214 / 475
» Complexities for generalized models of self-assembly
Sort
View
DEBS
2008
ACM
15 years 8 months ago
Event-based constraints for sensornet programming
We propose a sensornet programming model based on declarative spatio-temporal constraints on events only, not sensors. Where previous approaches conflate events and sensors becaus...
Jie Mao, John Jannotti, Mert Akdere, Ugur Ç...
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
16 years 6 months ago
Zero-knowledge against quantum attacks
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
John Watrous
SIGCOMM
2006
ACM
16 years 16 days ago
Revisiting IP multicast
This paper revisits a much explored topic in networking – the search for a simple yet fully-general multicast design. The many years of research into multicast routing have led ...
Sylvia Ratnasamy, Andrey Ermolinskiy, Scott Shenke...
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
16 years 3 days ago
Information landscapes and the analysis of search algorithms
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
Yossi Borenstein, Riccardo Poli
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
16 years 3 days ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener