Sciweavers

2703 search results - page 110 / 541
» Working Class Hero
Sort
View
ALT
1998
Springer
14 years 2 months ago
Predictive Learning Models for Concept Drift
Concept drift means that the concept about which data is obtained may shift from time to time, each time after some minimum permanence. Except for this minimum permanence, the con...
John Case, Sanjay Jain, Susanne Kaufmann, Arun Sha...
SIGMETRICS
1993
ACM
14 years 2 months ago
The Process-Flow Model: Examining I/O Performance from the System's Point of View
Input/output subsystem performance is currently receiving considerable research attention. Signi cant e ort has been focused on reducing average I/O response times and increasing ...
Gregory R. Ganger, Yale N. Patt
COCO
2010
Springer
152views Algorithms» more  COCO 2010»
14 years 2 months ago
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
Derrick Stolee, Chris Bourke, N. V. Vinodchandran
WG
2000
Springer
14 years 1 months ago
Networks with Small Stretch Number
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
Serafino Cicerone, Gabriele Di Stefano
AUTONOMICS
2008
ACM
14 years 3 days ago
QoS-aware ant routing with colored pheromones in wireless mesh networks
Inspired by the collective foraging behavior of specific ant species, ant-based routing algorithms are able to find optimal or near optimal packet routes for Wireless Mesh Network...
Martina Umlauft, Wilfried Elmenreich