Mobile robots require the ability to build their own maps to operate in unknown environments. A fundamental problem is that odometry-based dead reckoning cannot be used to assign ...
A n eficient fair queueing scheme which is feasible for broadband implementation is proposed and its performance is analyzed. We define fairness in a selfcontained manner, elimina...
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
This paper presents computer simulations which investigate the effect that different group sizes have on the emergence of compositional structures in languages. The simulations are...
As long as computers continue to get more CPU processing power, data centers need to optimize their power usage. We can do this and maintain the same complexity level as before by...