Sciweavers

14649 search results - page 90 / 2930
» Principles of problem solving
Sort
View
EOR
2007
70views more  EOR 2007»
14 years 11 months ago
Solving the maximum edge weight clique problem via unconstrained quadratic programming
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience rep...
Bahram Alidaee, Fred Glover, Gary A. Kochenberger,...
PC
2006
87views Management» more  PC 2006»
14 years 11 months ago
GridSAT: a system for solving satisfiability problems using a computational grid
In this paper, we present GridSAT
Wahid Chrabakh, Richard Wolski
82
Voted
JAIR
2010
99views more  JAIR 2010»
14 years 9 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
97
Voted
ANOR
2011
96views more  ANOR 2011»
14 years 6 months ago
Global propagation of side constraints for solving over-constrained problems
This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These ...
Thierry Petit, Emmanuel Poder
93
Voted
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
15 years 9 hour ago
Managing team-based problem solving with symbiotic bid-based genetic programming
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
Peter Lichodzijewski, Malcolm I. Heywood