Sciweavers

2108 search results - page 192 / 422
» Constrained Heuristic Search
Sort
View
UAI
2008
15 years 8 months ago
Convergent Message-Passing Algorithms for Inference over General Graphs with Convex Free Energies
Inference problems in graphical models can be represented as a constrained optimization of a free energy function. It is known that when the Bethe free energy is used, the fixedpo...
Tamir Hazan, Amnon Shashua
COMCOM
2006
75views more  COMCOM 2006»
15 years 6 months ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari
GECCO
2003
Springer
107views Optimization» more  GECCO 2003»
15 years 11 months ago
Exploration of a Two Sided Rendezvous Search Problem Using Genetic Algorithms
The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...
T. Q. S. Truong, A. Stacey
AI
2006
Springer
15 years 6 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
RTSS
2008
IEEE
16 years 27 days ago
Priority Assignment for Real-Time Wormhole Communication in On-Chip Networks
—Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, none of current priority assignment pol...
Zheng Shi, Alan Burns