Learning, planning, and representing knowledge in large state t multiple levels of temporal abstraction are key, long-standing challenges for building flexible autonomous agents. ...
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
In backbone networks, the line cards that drive the links between neighboring routers consume a large amount of energy. Since these networks are typically overprovisioned, selecti...
Flow-based networks such as OpenFlow-based networks have difficulty handling a large number of flows in a node due to the capacity limitation of search engine devices such as tern...
The particle swarm optimization algorithm was showed to converge rapidly during the initial stages of a global search, but around global optimum, the search process will become ve...
Jing-Ru Zhang, Jun Zhang, Tat-Ming Lok, Michael R....