697 search results - page 29 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
CEC
2008
IEEE
14 years 3 months ago
2008
IEEE
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
CEC
2003
IEEE
14 years 2 months ago
2003
IEEE
Although many methods for dealing with multi-objective optimisation (MOO) problems are available [Deb01] and successful applications have been reported [Coe01], the comparison betw...
CEC
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract- Significant operational cost and energy savings can be achieved by optimising the schedules of pumps, which pump water from source reservoirs to storage tanks, in Water ...
UAI
1996
13 years 10 months ago
1996
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...