Sciweavers

1029 search results - page 115 / 206
» Neural Networks and Complexity Theory
Sort
View
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
15 years 10 months ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...
IJCNN
2007
IEEE
15 years 10 months ago
Branching Principal Components: Elastic Graphs, Topological Grammars and Metro Maps
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
ICRA
2003
IEEE
108views Robotics» more  ICRA 2003»
15 years 9 months ago
On-line safe path planning in unknown environments
s - For the on-line safe path planning of a mobile robot in unknown environments, the paper proposes a simple Hopfield Neural Network ( HNN ) planner. Without learning process, the...
Weidong Chen, Changhong Fan, Yugeng Xi
131
Voted
CEC
2005
IEEE
15 years 6 months ago
Evolving autonomous agent control in the Xpilot environment
Abstract- Interactive combat games are useful as testbeds for learning systems employing evolutionary computation. Of particular value are games that can be modified to accommodate...
Gary B. Parker, Matt Parker, Steven D. Johnson
147
Voted
WOA
2001
15 years 5 months ago
Implementing Adaptive Capabilities on Agents that Act in a Dynamic Environment
Acting in a dynamic environment is a complex task that requires several issues to be investigated, with the aim of controlling the associated search complexity. In this paper, a l...
Giuliano Armano, Giancarlo Cherchi, Eloisa Vargiu