Sciweavers

1662 search results - page 68 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
ICDCSW
2005
IEEE
14 years 2 months ago
Bandwidth Clustering for Reliable and Prioritized Network Routing Using Split Agent-Based Method
Recent researches have highlighted the importance of developing a network with distributed problem solving abilities thus enhancing reliability with equal share of network resourc...
Constandinos X. Mavromoustakis, Helen D. Karatza
AAAI
2006
13 years 10 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
IJFCS
2007
77views more  IJFCS 2007»
13 years 8 months ago
Optimal Construction of Sense of Direction in a Torus by a Mobile Agent
Sense of direction is a property of the edge-labeling of a network whose availability facilitates computations and often decreases their complexity. In this paper we consider the ...
Hanane Becha, Paola Flocchini
AI
1998
Springer
13 years 8 months ago
The Logical Foundations of Goal-Regression Planning in Autonomous Agents
This paper addresses the logical foundations of goal-regression planning in autonomous rational agents. It focuses mainly on three problems. The first is that goals and subgoals w...
John L. Pollock
SAC
2000
ACM
14 years 1 months ago
The Mobile Agent Technology to Support and to Access Museum Information
The global scenario put together by communication networks determines new opportunities towards the realization of Internetbased distributed services in many complex and composite...
Paolo Bellavista, Antonio Corradi, Andrea Tomasi