Sciweavers

826 search results - page 153 / 166
» Designing for families
Sort
View
IPSN
2004
Springer
14 years 2 days ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
JELIA
2004
Springer
14 years 2 days ago
tascpl: TAS Solver for Classical Propositional Logic
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
Manuel Ojeda-Aciego, Agustín Valverde
P2P
2003
IEEE
108views Communications» more  P2P 2003»
14 years 1 hour ago
Multicast in DKS(N, k, f) Overlay Networks
Recent developments in the area of peer-to-peer computing show that structured overlay networks implementing distributed hash tables scale well and can serve as infrastructures fo...
Luc Onana Alima, Ali Ghodsi, Sameh El-Ansary, Per ...
SPAA
2003
ACM
13 years 12 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder
ERSHOV
2003
Springer
13 years 12 months ago
The Outside-In Method of Teaching Introductory Programming
The new design for the introductory programming course at ETH relies on object technology, Eiffel, extensive reuse, a graphics-rich library (TRAFFIC) built specifically for the c...
Bertrand Meyer