Sciweavers

3204 search results - page 626 / 641
» The Alcuin Number of a Graph
Sort
View
JACM
2006
134views more  JACM 2006»
13 years 10 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
MICRO
2008
IEEE
79views Hardware» more  MICRO 2008»
13 years 10 months ago
Strategies for mapping dataflow blocks to distributed hardware
Distributed processors must balance communication and concurrency. When dividing instructions among the processors, key factors are the available concurrency, criticality of depen...
Behnam Robatmili, Katherine E. Coons, Doug Burger,...
ML
2006
ACM
143views Machine Learning» more  ML 2006»
13 years 10 months ago
Mathematical applications of inductive logic programming
The application of Inductive Logic Programming to scientific datasets has been highly successful. Such applications have led to breakthroughs in the domain of interest and have dri...
Simon Colton, Stephen Muggleton
JDA
2007
129views more  JDA 2007»
13 years 10 months ago
Approximating the k-traveling repairman problem with repairtimes
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
Raja Jothi, Balaji Raghavachari
CLUSTER
2002
IEEE
13 years 10 months ago
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
Mainak Chatterjee, Sajal K. Das, Damla Turgut