Sciweavers

1662 search results - page 127 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
BMCBI
2006
100views more  BMCBI 2006»
15 years 3 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
ATAL
2008
Springer
15 years 5 months ago
MADeM: a multi-modal decision making for social MAS
This paper presents MADeM, a multi-modal agent decision making to provide virtual agents with socially acceptable decisions. We consider multi-modal decisions as those that are ab...
Francisco Grimaldo, Miguel Lozano, Fernando Barber
163
Voted
AAMAS
2004
Springer
15 years 3 months ago
Automated Assistants for Analyzing Team Behaviors
Multi-agent teamwork is critical in a large number of agent applications, including training, education, virtual enterprises and collective robotics. The complex interactions of ag...
Ranjit Nair, Milind Tambe, Stacy Marsella, Taylor ...
IPPS
2007
IEEE
15 years 10 months ago
A Near-optimal Solution for the Heterogeneous Multi-processor Single-level Voltage Setup Problem
A heterogeneous multi-processor (HeMP) system consists of several heterogeneous processors, each of which is specially designed to deliver the best energy-saving performance for a...
Tai-Yi Huang, Yu-Che Tsai, Edward T.-H. Chu
135
Voted
EUROCAST
2007
Springer
132views Hardware» more  EUROCAST 2007»
15 years 7 months ago
Using Omnidirectional BTS and Different Evolutionary Approaches to Solve the RND Problem
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...