697 search results - page 98 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...
AIPS
2008
13 years 10 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
Wireless sensor networks are tightly associated with the underlying environment in which the sensors are deployed. The global topology of the network is of great importance to bot...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
— Genetic algorithms (GAs) have been argued to constitute a flexible search thereby enabling to solve difficult problems which classical optimization methodologies may find ha...