Sciweavers

1477 search results - page 195 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
CIG
2005
IEEE
15 years 3 months ago
Utile Coordination: Learning Interdependencies Among Cooperative Agents
AbstractWe describe Utile Coordination, an algorithm that allows a multiagent system to learn where and how to coordinate. The method starts with uncoordinated learners and maintai...
Jelle R. Kok, Pieter Jan't Hoen, Bram Bakker, Niko...
FOCS
2002
IEEE
15 years 2 months ago
Learning a Hidden Matching
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
Noga Alon, Richard Beigel, Simon Kasif, Steven Rud...
SIGCSE
2000
ACM
193views Education» more  SIGCSE 2000»
15 years 2 months ago
Experimentation with bounded buffer synchronization
Undergraduates are usually introduced to synchronization in operating systems through a discussion of classical problems such as reader-writer or producers-consumers. The traditio...
Steven Robbins
IPPS
1996
IEEE
15 years 2 months ago
Efficient Run-Time Support for Irregular Task Computations with Mixed Granularities
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...
Cong Fu, Tao Yang
ISLPED
1996
ACM
91views Hardware» more  ISLPED 1996»
15 years 2 months ago
Energy minimization using multiple supply voltages
We present a dynamic programming technique for solving the multiple supply voltage scheduling problem in both nonpipelined and functionally pipelined data-paths. The scheduling pro...
Jui-Ming Chang, Massoud Pedram