Performance measurement and data base design
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
We investigate the existence of various limits and colimits in three categories: CPI (chain-complete posets and isotone maps); CPC (chain-complete posets and chain-continuous maps); CPC* (chain-complete posets and chain-continuous maps). Among other things we show CPC to be complete and cocomplete. By way of contrast we show that LC* (complete lattices and chain-*continuous maps) is neither complete nor cocomplete. We also introduce a construction which yields the chain-completion of a poset and other "completions" as special cases. © 1977.
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996