3406 search results - page 44 / 682 » General Search Algorithms for Energy Minimization Problems |
AICOM
2004
13 years 8 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
Restoring binary images is a problem which arises in various application fields. In our paper, this problem is considered in a variational framework: the sought-after solution min...
AUSAI
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
CISS
2010
IEEE
12 years 11 months ago
2010
IEEE
—This paper addresses optimal spectrum sensing in cognitive radio networks considering its system level cost that accounts for the local processing cost of sensing (sample collec...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...