1662 search results - page 249 / 333 » The Computational Complexity of Agent Design Problems |
ATAL
2007
Springer
14 years 3 months ago
2007
Springer
Activity recognition is a key component for creating intelligent, multi-agent systems. Intrinsically, activity recognition is a temporal classification problem. In this paper, we...
FPL
2010
Springer
13 years 6 months ago
2010
Springer
One of the more popular placement algorithms for Field Programmable Gate Arrays (FPGAs) is called Simulated Annealing (SA). This algorithm tries to create a good quality placement ...
SIGECOM
2010
ACM
14 years 1 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
DFN
2003
13 years 10 months ago
2003
In recent years research activities in computer network security focus more actively on the development of effective methods in intrusion detection. The reason for this developmen...
CIS
2004
Springer
14 years 2 months ago
2004
Springer
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...