?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
In this paper we consider the solution of scheduling problems that are inherently over-subscribed. In such problems, there are always more tasks to execute within a given time fra...
The Grid promise is starting to materialize today: largescale multi-site infrastructures have grown to assist the work of scientists from all around the world. This tremendous gro...
phies are also mentioned and a common mathematical abstraction for all these inverses problems will be presented. By focusing on a simple linear forward model, first a synthetic an...