Sciweavers

807 search results - page 26 / 162
» Competition Adds Complexity
Sort
View
CIG
2005
IEEE
15 years 3 months ago
Building Reactive Characters for Dynamic Gaming Environments
Interactive computer games are widely seen as a killer application domain for Artificial Intelligence (AI) [8]. Quite apart from the significant size of the games market in terms...
Peter Blackburn, Barry O'Sullivan
ATAL
2005
Springer
15 years 3 months ago
Evaluating the Minority Game strategy in agent role assignments
A team-based competitive environment is a complex multiagent environment, in which agents are required to coordinate with each other not only to enhance their collective behavior,...
Tingting Wang, Jiming Liu
72
Voted
FSE
2010
Springer
144views Cryptology» more  FSE 2010»
15 years 2 months ago
Pseudo-cryptanalysis of the Original Blue Midnight Wish
The hash function Blue Midnight Wish (BMW) is a candidate in the SHA-3 competition organised by the U.S. National Institute of Standards and Technology (NIST). BMW was selected fo...
Søren S. Thomsen
ICECCS
1995
IEEE
100views Hardware» more  ICECCS 1995»
15 years 1 months ago
POSD-a notation for presenting complex systems of processes
When trying to describe the behaviour of large systems, such as the business processes of large enterprises, we often adopt diagramming techniques based on derivatives of data flo...
Peter Henderson, Graham D. Pratten
COR
2008
122views more  COR 2008»
14 years 9 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr