The Three Dimensional Bin Packing Problem (3DBPP) is within one of the broad categories of the Bin Packing Problem. The other broad categories include the One Dimensional and the Two Dimensional Bin Packing Problem. As we live in a three dimensional world, the 3DBPP can model a variety of real world problems. Some of the popular applications of the 3DBPP include the Container Loading Problem an...

The problem of bin packing with arbitrary conflicts was introduced in [3]. In this paper, we consider a restricted problem, bin packing with clique-graph conflicts. We prove bounds for several approximation algorithms, and show that certain onand off-line algorithms are equivalent. Finally, we present an optimal polynomial-time algorithm for the case of constant item sizes, and analyze its perf...

In the age of Big Data the problem of storing huge volume of data in a minimum storage space by utilizing available resources properly is an open problem and an important research aspect in recent days. This problem has a close relationship with the famous classical NP-Hard combinatorial optimization problem namely the “Bin Packing Problem” where bins represent available storage space and the p...

Nowadays certain actions are taken to improve the level of cleanliness in the country. People are getting more active in doing all the things possible to clean their surroundings. Various movements are also started by the government to increase cleanliness. We will try to build a system which will notify the corporations to empty the bin on time. In this system, we will put a sensor on top of t...

.............................................................................................................123 Introduction........................................................................................................123 Method...............................................................................................................128 Participants and Design ......................

It is vital for a scheduler to efficiently determine when a resource is unassigned to some previously scheduled operation. Efficient algorithms are needed for calculating, querying, and updating this information. This paper presents an approach for using height-balanced trees for storing resource availablity information. We show that availibility queries are then efficient and that updates can ...

We describe our participation in the PASCAL-2005 Recognizing Textual Entailment Challenge. Our method is based on calculating “directed” sentence similarity: checking the directed “semantic” word overlap between the text and the hypothesis. We use frequency-based term weighting in combination with two different lexical similarity measures. Our best run shows 0.55 accuracy on the test data, alth...