Sciweavers

246 search results - page 13 / 50
» Dynamic Local Search for the Maximum Clique Problem
Sort
View
CP
1995
Springer
15 years 1 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo
CP
2005
Springer
15 years 3 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich
HICSS
2006
IEEE
97views Biometrics» more  HICSS 2006»
15 years 3 months ago
Dynamically Optimizing Parameters in Support Vector Regression: An Application of Electricity Load Forecasting
This study develops a novel model, GA-SVR, for parameters optimization in support vector regression and implements this new model in a problem forecasting maximum electrical daily...
Chin-Chia Hsu, Chih-Hung Wu, Shih-Chien Chen, Kang...
CONSTRAINTS
2007
112views more  CONSTRAINTS 2007»
14 years 9 months ago
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
Francisco Azevedo
DMTCS
2006
66views Mathematics» more  DMTCS 2006»
14 years 9 months ago
On randomly colouring locally sparse graphs
We consider the problem of generating a random q-colouring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if for all v V the average degree of...
Alan M. Frieze, Juan Vera