Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
The techniques of information retrieval and information extraction are complementary, but to date there has been little concrete work aimed at integrating the two. We describe how...
Real-life date is often dirty and costs billions of pounds to businesses worldwide each year. This paper presents a promising approach to improving data quality. It effectively det...
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
In this paper, the stability of equilibrium formations for multiple unicycle systems in cyclic pursuit is studied in detail. The cyclic pursuit setup is particularly simple in tha...
Joshua A. Marshall, Mireille E. Broucke, Bruce A. ...