P
Pragnesh Jay Modi
Researcher at Drexel University
Publications - 39
Citations - 2422
Pragnesh Jay Modi is an academic researcher from Drexel University. The author has contributed to research in topics: Distributed constraint optimization & Distributed algorithm. The author has an hindex of 20, co-authored 39 publications receiving 2377 citations. Previous affiliations of Pragnesh Jay Modi include Carnegie Mellon University & University of Southern California.
Papers
More filters
Journal ArticleDOI
Adopt: asynchronous distributed constraint optimization with quality guarantees
TL;DR: This work proposes a polynomial-space algorithm for DCOP named Adopt that is guaranteed to find the globally optimal solution while allowing agents to execute asynchronously and in parallel and has the ability to quickly find approximate solutions and maintain a theoretical guarantee on solution quality.
Proceedings ArticleDOI
An asynchronous complete method for distributed constraint optimization
TL;DR: A new polynomial-space algorithm, called Adopt, that is guaranteed to find an optimal solution, or a solution within a user-specified distance from the optimal, while allowing agents to execute asynchronously and in parallel, and provides provable quality guarantees.
Proceedings Article
Modeling Web sources for information integration
Craig A. Knoblock,Steven Minton,José Luis Ambite,Naveen Ashish,Pragnesh Jay Modi,Ion Muslea,Andrew Philpot,Sheila Tejada +7 more
TL;DR: This work has developed methods for mapping web sources into a simple, uniform representation that makes it efficient to integrate multiple sources and makes it easy to maintain these agents and incorporate new sources as they become available.
Book ChapterDOI
CMRadar: a personal assistant agent for calendar management
TL;DR: CMRadar is an implemented system with wide-ranging capabilities for supporting email exchange, multiagent negotiations and schedule optimization based on user preferences, and the motivation is to develop an end-to-end system for use by real users to obtain data to facilitate learning.
Book ChapterDOI
A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation
TL;DR: This paper defines the notion of Dynamic Distributed Constraint Satisfaction Problem (DyDCSP) and proposes two generalized mappings from distributed resource allocation to DyDCSP, each proven to correctly perform resource allocation problems of specific difficulty.