1712 search results - page 167 / 343 » A Computational Approach to Binding Theory |
104
click to vote
AUTOMATICA
2002
15 years 1 months ago
2002
This paper addresses the computation of the required trajectory correction maneuvers (TCM) for a halo orbit space mission to compensate for the launch velocity errors introduced b...
162
click to vote
TIM
2010
14 years 8 months ago
2010
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
111
click to vote
MOMM
2009
ACM
15 years 6 months ago
2009
ACM
New directions in the provision of end-user computing experiences mean that we need to determine the best way to share data between small mobile computing devices. Partitioning la...
113
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
131
Voted
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
This paper investigates the effects of two different communication protocols within an artificial society, where communication and cooperation is necessary to survive. Communicat...