Sciweavers

483 search results - page 70 / 97
» On perfectness of sums of graphs
Sort
View
IPPS
2005
IEEE
14 years 2 months ago
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
Guojing Cong, David A. Bader
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
14 years 12 days ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
FLAIRS
2008
13 years 11 months ago
A Semantic Method for Textual Entailment
The problem of recognizing textual entailment (RTE) has been recently addressed using syntactic and lexical models with some success. Here, we further explore this problem, this t...
Andrew Neel, Max H. Garzon, Vasile Rus
CCCG
1997
13 years 10 months ago
On the number of internal and external visibility edges of polygons
In this paper we prove that for any simple polygon P with n vertices, the sum of the number of strictly internal edges and the number of strictly external visibility edges of P is...
Jorge Urrutia
JMLR
2006
153views more  JMLR 2006»
13 years 8 months ago
Collaborative Multiagent Reinforcement Learning by Payoff Propagation
In this article we describe a set of scalable techniques for learning the behavior of a group of agents in a collaborative multiagent setting. As a basis we use the framework of c...
Jelle R. Kok, Nikos A. Vlassis