Sciweavers

3367 search results - page 619 / 674
» Incremental assignment problem
Sort
View
SPAA
2012
ACM
13 years 5 days ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
ICML
1996
IEEE
15 years 10 months ago
Learning Evaluation Functions for Large Acyclic Domains
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...
Justin A. Boyan, Andrew W. Moore
LISA
2004
14 years 11 months ago
autoMAC: A Tool for Automating Network Moves, Adds, and Changes
It is often difficult and time-consuming to manage computer `moves, adds, and changes' that take place in a switched, subnetted environment. It is even more difficult when th...
Christopher J. Tengi, James M. Roberts, Joseph R. ...
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
15 years 10 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
CVPR
2008
IEEE
15 years 11 months ago
Matching images under unstable segmentations
Region based features are getting popular due to their higher descriptive power relative to other features. However, real world images exhibit changes in image segments capturing ...
Varsha Hedau, Himanshu Arora, Narendra Ahuja