Sciweavers

2343 search results - page 368 / 469
» The Locomotive Routing Problem
Sort
View
138
Voted
INFOVIS
2003
IEEE
15 years 10 months ago
EdgeLens: An Interactive Method for Managing Edge Congestion in Graphs
An increasing number of tasks require people to explore, navigate and search extremely complex data sets visualized as graphs. Examples include electrical and telecommunication ne...
Nelson Wong, M. Sheelagh T. Carpendale, Saul Green...
LICS
2003
IEEE
15 years 10 months ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
166
Voted
P2P
2003
IEEE
115views Communications» more  P2P 2003»
15 years 10 months ago
NanoPeer Networks and P2P Worlds
We present the NanoPeers architecture paradigm, a peer-to-peer network of lightweight devices, lacking all or most of the capabilities of their computer-world counterparts. We ide...
Peter Triantafillou, Nikos Ntarmos, Sotiris E. Nik...
ISPD
2003
ACM
92views Hardware» more  ISPD 2003»
15 years 10 months ago
Benchmarking for large-scale placement and beyond
Over the last five years the VLSI Placement community achieved great strides in the understanding of placement problems, developed new high-performance algorithms, and achieved i...
Saurabh N. Adya, Mehmet Can Yildiz, Igor L. Markov...
IPTPS
2003
Springer
15 years 9 months ago
Rationality and Self-Interest in Peer to Peer Networks
Much of the existing work in peer to peer networking assumes that users will follow prescribed protocols without deviation. This assumption ignores the user’s ability to modify ...
Jeffrey Shneidman, David C. Parkes