Sciweavers

14386 search results - page 263 / 2878
» The Chinese Generals Problem
Sort
View
ICTAI
2008
IEEE
15 years 11 months ago
Finding Good Starting Points for Solving Structured and Unstructured Nonlinear Constrained Optimization Problems
In this paper, we develop heuristics for finding good starting points when solving large-scale nonlinear constrained optimization problems (COPs). We focus on nonlinear programmi...
Soomin Lee, Benjamin W. Wah
HPDC
2007
IEEE
15 years 11 months ago
Smartsockets: solving the connectivity problems in grid computing
Tightly coupled parallel applications are increasingly run in Grid environments. Unfortunately, on many Grid sites the ability of machines to create or accept network connections ...
Jason Maassen, Henri E. Bal
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
15 years 11 months ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
Tao Gong, Andrew Tuson
GECCO
2007
Springer
326views Optimization» more  GECCO 2007»
15 years 11 months ago
Binary differential evolution for the unit commitment problem
The Unit Commitment Problem (UCP) is the task of finding an optimal turn on and turn off schedule for a group of power generation units over a given time horizon to minimize ope...
Ali Keles
MFCS
2007
Springer
15 years 11 months ago
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
Jaroslav Nesetril, Mark H. Siggers