Sciweavers

2693 search results - page 92 / 539
» On Computing Complex Navigation Functions
Sort
View
ENTCS
2008
102views more  ENTCS 2008»
13 years 10 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
TC
2011
13 years 5 months ago
Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks
— Processing the gathered information efficiently is a key functionality for wireless sensor networks. In this article, we study the time complexity, message complexity (number ...
Xiang-Yang Li, Yajun Wang, Yu Wang
IFIP13
2004
13 years 11 months ago
Analysing Dynamic Function Scheduling Decisions
: Function allocation, as a process used in the construction of dependable complex systems, is a significant aspect of the design and implementation of interactive systems. It invo...
Karsten Loer, Michael Hildebrandt, Michael D. Harr...
COCO
2003
Springer
93views Algorithms» more  COCO 2003»
14 years 3 months ago
The complexity of stochastic sequences
We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random random sequences su...
Wolfgang Merkle
RTAS
2009
IEEE
14 years 4 months ago
Lightweight Modeling of Complex State Dependencies in Stream Processing Systems
Over the last few years, Real-Time Calculus has been used extensively to model and analyze embedded systems processing continuous data/event streams. Towards this, bounds on the a...
Anne Bouillard, Linh T. X. Phan, Samarjit Chakrabo...