2542 search results - page 334 / 509 » Computing Cartograms with Optimal Complexity |
ICRA
2000
IEEE
14 years 3 months ago
2000
IEEE
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 ...
INFOCOM
1994
IEEE
14 years 2 months ago
1994
IEEE
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...
KR
1989
Springer
14 years 2 months ago
1989
Springer
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...
ECAL
2007
Springer
14 years 2 months ago
2007
Springer
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...
ICAS
2009
IEEE
14 years 2 months ago
2009
IEEE
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...