Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sarosh Talukdar

dblp:t/SaroshTalukdar · also Sarosh N. Talukdar · DBLP profile ↗
← Back
11ranked-venue papers
3as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 2Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Multi-agent systems · 56% Knowledge representation and reasoning · 28% Motion planning and robot control · 16%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Performance modeling and evaluation · 41% Parallel and multicore computing · 32% Distributed systems · 28%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Energy systems and smart grids · 100%
Human-computer interaction and pervasive computing
1 paper
User interface design and tools · 100%

Topics — the 7 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
expert systems
0.011985
An Expert System for Understanding Expressions from Electric Circuit Analysis · IJCAI 1985
Performance modeling and evaluation › performance prediction
execution time prediction
0.011984
Scheduling of Tasks for Distributed Processors · ISCA 1984
Parallel and multicore computing
task scheduling
0.011984
Scheduling of Tasks for Distributed Processors · ISCA 1984
Robotics › Motion planning and robot control
mobile robot control
0.011983
A Distributed Control System for the CMU Rover · IJCAI 1983
Distributed systems
distributed control
0.011983
A Distributed Control System for the CMU Rover · IJCAI 1983
User interface design and tools › design tools
design systems
0.011988
Upgrading Design Systems · AAAI 1988
Knowledge, reasoning and agents › Knowledge representation and reasoning
commonsense reasoning
0.011985
An Expert System for Understanding Expressions from Electric Circuit Analysis · IJCAI 1985

Methods — techniques the papers use, named apart from their topics

multi-agent system design · 0.0analytical performance modeling · 0.0
YearPublicationVenuePosition
2005 Designing Communication Networks to Decompose Network Control Problems
abstract
The pressure from today’s economic and energy markets demands further distribution of decision making in large, dynamic networks. To this end, distributed model predictive control (MPC) divides the task of operating a dynamic network into a set of small, localized subtasks, one for each distributed control agent. To guide the decomposition of the overall task, which plays a central role in the quality of the operation yielded by the distributed agents, this paper proposes a model for problem decomposition based on the design of agent communication networks. The model gives rise to the communication-network design problem: A bicriteria optimization problem whose objectives are the maximization of the influence perceived by the agents and the minimization of the communication cost. The benefit of the model is the potential to concentrate the effort of implementing distributed MPC, and measuring its actual performance, on a reduced number of decompositions, namely those that are Pareto efficient for the model. The paper gives an account of related work, including the computational complexity of finding Pareto efficient solutions, an integer programming formulation, and families of valid inequalities. Its main contribution is the demonstration that the model can be effective, meaning that Pareto efficient solutions to the model tend to induce efficient problem decompositions. The experimental evidence was gathered by applying the model to decompose control problems of two representative networks, namely arrays of pendulums and electric power networks, and measuring the quality of the operation delivered by the distributed control agents.
Eduardo Camponogara, Sarosh Talukdar
INFORMS J. Comput.2
2003 Engineering of markets and artifacts
abstract
In this paper, we continue the dialog started by Roth [19] between economics and engineering in the context of design of markets. We take the position that markets and engineered artifacts are thee the products of a social process of design formulation. Our perspective is that designing of markets and artifacts follow the same kind of problem formulation and solution testing process. Further, we show through two case studies, that the design of engineered artifacts and markets are often interdependent. In light of their similarities, methodologies for modeling and testing using theoretical, analytical, computation and physical models in engineering can inform the development of methods for testing in the design of markets. We also illustrate by example devising of a test and results of its execution thorough the use of a simple computational model with the required salient features of an electric power market. We conclude by summarizing the similarities between the designing of markets and artifacts and call for a continued dialogue between engineers and economists.
Eswaran Subrahmanian, Sarosh Talukdar
ICEC2
1999 Collaboration rules for autonomous software agents
Sarosh Talukdar
Decis. Support Syst.1
1993 The engineering design research center of Carnegie Mellon University
abstract
The Engineering Design Research Center (EDRC) promotes the establishment and dissemination of a scientific basis for design based on an interdisciplinary approach to researrh and education. The Center's vision is that a scientific framework for design can exploit rapid advances in computer and communications technologies to serve the competitive need for reduced product development cycles, improved quality and reliability, and lower cost. Basic notions of the product cycle underlie the Center's strategic plan, a framework of researrh thrusts leading from barriers in design science to goals and vision. As an NSF Engineering Research Center, EDRC conducts cross-educational and industrial programs in parallel with research
Georgette H. Demes, Steven J. Fenves, Ignacio E. Grossmann, Chris T. Hendrickson, Tom M. Mitchell, Friedrich B. Prinz, Daniel P. Siewiorek, Eswaran Subrahmanian, Sarosh Talukdar, Arthur Westerberg
Proc. IEEE9
1992 Multiagent organizations for real-time operations
abstract
The real-time operations of electric power networks are subject to two sets of forces. The first, including deregulation movements and growing environmental concerns, is acting to increase the complexity of operations. The second, including new computer technologies and emerging knowledge-based agents, provides some means for handling additional complexity. The authors argue that organizational changes will have to be made before the second set of forces can be applied to effectively counter the first. To make this argument, a framework for discussing organizational structures is presented. Then the structures of the two generations of computer-based, multiagent systems that have been developed for operations are reviewed. It is pointed out that these structures are well-suited to the algorithmic tasks involved in operations but not to the knowledge-based tasks. The authors conclude with some suggestions for research into alternative structures.>
Sarosh Talukdar, V. C. Ramesh, Richard Quadrel, Richard Christie
Proc. IEEE1
1990 Applications of AI in design research at Carnegie Mellon University's EDRC
Arthur Westerberg, Ignacio E. Grossmann, Sarosh Talukdar, Friedrich Prinz, Steven J. Fenves, Mary Lou Maher
Artif. Intell. Eng.3
1988 Upgrading Design Systems
Sarosh Talukdar, James M. Rehg, Robert F. Woodbury, Alberto Elfes
AAAI1
1986 An environment for rule-based blackboards and distributed problem solving
Luiz V. Leão, Sarosh Talukdar
Artif. Intell. Eng.2
1985 An Expert System for Understanding Expressions from Electric Circuit Analysis
Rostam Joobbani, Sarosh Talukdar
IJCAI2
1984 Scheduling of Tasks for Distributed Processors
abstract
The paper describes a technique for estimating the minimum execution time of an algorithm or a mix of algorithms on a distributed processing system. Bottlenecks that would have to be removed to further reduce the execution time are identified. The main applications are for the high level design of special purpose distributed processing systems.
Ravi Mehrotra, Sarosh Talukdar
ISCA2
1983 A Distributed Control System for the CMU Rover
Alberto Elfes, Sarosh Talukdar
IJCAI2