Sciweavers

1963 search results - page 128 / 393
» The Maximum Solution Problem on Graphs
Sort
View
111
Voted
ECCV
1998
Springer
16 years 4 months ago
Matching Hierarchical Structures Using Association Graphs
?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
130
Voted
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
15 years 6 months ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
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...
Philipp Rohlfshagen, John A. Bullinaria
IJCAI
2003
15 years 3 months ago
Maximizing Flexibility: A Retraction Heuristic for Oversubscribed Scheduling Problems
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...
Laurence A. Kramer, Stephen F. Smith
123
Voted
CCGRID
2007
IEEE
15 years 9 months ago
Build-and-Test Workloads for Grid Middleware: Problem, Analysis, and Applications
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...
Alexandru Iosup, Dick H. J. Epema
VISAPP
2010
15 years 12 days ago
Inverse Problems in Imaging and Computer Vision - From Regularization Theory to Bayesian Inference
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...
Ali Mohammad-Djafari