Sciweavers

4744 search results - page 107 / 949
» Connected Computing
Sort
View
TPDS
2010
109views more  TPDS 2010»
15 years 4 months ago
Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa
PERCOM
2004
ACM
16 years 5 months ago
A User-Guided Cognitive Agent for Network Service Selection in Pervasive Computing Environments
Connectivity is central to pervasive computing environments. We seek to catalyze a world of rich and diverse connectivity through technologies that drastically simplify the task o...
George Lee, Peyman Faratin, Steven Bauer, John Wro...
CHI
2000
ACM
15 years 10 months ago
curlybot: designing a new class of computational toys
We introduce an educational toy, called curlybot, as the basis for a new class of toys aimed at children in their early stages of development – ages four and up. curlybot is an ...
Phil Frei, Victor Su, Bakhtiar Mikhak, Hiroshi Ish...
AINA
2007
IEEE
16 years 20 days ago
Sizing Router Buffers for Large-Scale TCP/IP Networks
— We investigate the validity of reducing router buffer size in a large-scale network that includes both core networks and edge networks. We first devise a novel mathematical an...
Hiroyuki Hisamatsu, Go Hasegawa, Masayuki Murata
MOBIQUITOUS
2007
IEEE
16 years 18 days ago
Towards Scalable and Robust Service Discovery in Ubiquitous Computing Environments via Multi-hop Clustering
Abstract— Large-scale ubiquitous computing environments require scalable and robust service discovery to enable “anytime, anywhere” computing, which is hard to be satisfied ...
Wei Gao