A methodology for the exploration of the partition table

Information theorists agree that robust algorithms are an interesting new topic in the field of complexity theory. The partition table of hard disk is very important data for operating system. In this paper, we provide a new methodology on the exploration of the partition table. We proposed an algorithm of partition table and presented expressions of calculating partition data.

[1]  Vladimir Lifschitz,et al.  Nested expressions in logic programs , 1999, Annals of Mathematics and Artificial Intelligence.

[2]  Bing He,et al.  Optimizing the Internet Gateway Deployment in a Wireless Mesh Network , 2007, 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems.

[3]  David Coley,et al.  Introduction to Genetic Algorithms for Scientists and Engineers , 1999 .

[4]  Norman Y. Foo,et al.  Solving Logic Program Conflict through Strong and Weak Forgettings , 2005, IJCAI.

[5]  Yigal Bejerano.  Efficient integration of multihop wireless and wired networks with QoS constraints , 2004, IEEE/ACM Trans. Netw..

[6]  Yigal Bejerano.  Efficient integration of multihop wireless and wired networks with QoS constraints , 2004, IEEE/ACM Transactions on Networking.

[7]  Mohamed F. Younis,et al.  Intelligent Gateways Placement for Reduced Data Latency in Wireless Sensor Networks , 2007, 2007 IEEE International Conference on Communications.

[8]  Guihai Chen,et al.  Analysis of Bottleneck Delay and Throughput in Wireless Mesh Networks , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[9]  Hongyi Wu,et al.  Minimum-cost gateway deployment in cellular Wi-Fi networks , 2006, CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006..

[10]  Peter Stone,et al.  Implicit Negotiation in Repeated Games , 2001, ATAL.

[11]  Peter Gärdenfors,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[12]  Ranveer Chandra,et al.  Optimizing the Placement of Integration Points in Multi-hop Wireless Networks , 2004 .

[13]  Jangeun Jun,et al.  Fairness and QoS in multihop wireless networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[14]  H. Sabourian,et al.  Complexity and Efficiency in Repeated Games and Negotiation , 2004 .

[15]  Norman Y. Foo,et al.  Infinitary Belief Revision , 2001, J. Philos. Log..

[16]  Jihong Lee,et al.  Complexity and Efficiency in Repeated Games with Negotiation , 2003 .

[17]  Yan Zhang,et al.  A Computational Model of Logic-Based Negotiation , 2006, AAAI.

[18]  Ying Zhang,et al.  A characterization of answer sets for logic programs , 2007, Science in China Series F: Information Sciences.

[19]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[20]  Norman Y. Foo,et al.  Negotiation as Mutual Belief Revision , 2004, AAAI.

[21]  Hassan Peyravi,et al.  Gateway Placement with QoS Constraints in Wireless Mesh Networks , 2008, Seventh International Conference on Networking (icn 2008).

[22]  Raouf Boutaba,et al.  Gateway Placement Optimization in Wireless Mesh Networks With QoS Constraints , 2006, IEEE Journal on Selected Areas in Communications.