Sciweavers

673 search results - page 117 / 135
» Preference-Based Problem Solving for Constraint Programming
Sort
View
ICML
2007
IEEE
14 years 8 months ago
What is decreased by the max-sum arc consistency algorithm?
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
Tomás Werner
DATE
2007
IEEE
114views Hardware» more  DATE 2007»
14 years 1 months ago
Two-level microprocessor-accelerator partitioning
The integration of microprocessors and field-programmable gate array (FPGA) fabric on a single chip increases both the utility and necessity of tools that automatically move softw...
Scott Sirowy, Yonghui Wu, Stefano Lonardi, Frank V...
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
13 years 8 months ago
Exploiting the path of least resistance in evolution
Hereditary Repulsion (HR) is a selection method coupled with a fitness constraint that substantially improves the performance and consistency of evolutionary algorithms. This als...
Gearoid Murphy, Conor Ryan
TOOLS
2008
IEEE
14 years 1 months ago
Component Reassembling and State Transfer in MaDcAr-Based Self-adaptive Software
In this paper, we introduce MaDcAr, a model of engines for dynamic and automatic (re)assembling of component-based software. In MaDcAr, an application description consists of the d...
Guillaume Grondin, Noury Bouraqadi, Laurent Vercou...
COR
2008
99views more  COR 2008»
13 years 7 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi