Sciweavers

291 search results - page 36 / 59
» How Well Can Primal-Dual and Local-Ratio Algorithms Perform
Sort
View
IAT
2009
IEEE
15 years 8 months ago
Myopic and Non-myopic Communication under Partial Observability
—In decentralized settings with partial observability, agents can often benefit from communicating, but communication resources may be limited and costly. Current approaches ten...
Alan Carlin, Shlomo Zilberstein
GLOBECOM
2008
IEEE
15 years 8 months ago
Foresighted Resource Reciprocation Strategies in P2P Networks
—We consider peer-to-peer (P2P) networks, where multiple peers are interested in sharing content. While sharing resources, autonomous and self-interested peers need to make decis...
Hyunggon Park, Mihaela van der Schaar
CSCLP
2006
Springer
15 years 5 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
IPPS
1999
IEEE
15 years 5 months ago
A Flexible Clustering and Scheduling Scheme for Efficient Parallel Computation
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...
S. Chingchit, Mohan Kumar, Laxmi N. Bhuyan
SIGGRAPH
2000
ACM
15 years 5 months ago
Timewarp rigid body simulation
The traditional high-level algorithms for rigid body simulation work well for moderate numbers of bodies but scale poorly to systems of hundreds or more moving, interacting bodies...
Brian Mirtich