Sciweavers

2108 search results - page 254 / 422
» Constrained Heuristic Search
Sort
View
AAAI
1996
15 years 7 months ago
Enhancements of Branch and Bound Methods for the Maximal Constraint Satisfaction Problem
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
Richard J. Wallace
CEC
2010
IEEE
15 years 3 months ago
A hybrid multi-objective extremal optimisation approach for multi-objective combinatorial optimisation problems
Extremal optimisation (EO) is a relatively recent nature-inspired heuristic whose search method is especially suitable to solve combinatorial optimisation problems. To date, most o...
Pedro Gómez-Meneses, Marcus Randall, Andrew...
ICDCS
2007
IEEE
16 years 22 days ago
LagOver: Latency Gradated Overlays
We propose a new genre of overlay network for disseminating information from popular but resource constrained sources. We call this communication primitive as Latency Gradated Ove...
Anwitaman Datta, Ion Stoica, Michael J. Franklin
NIPS
1998
15 years 7 months ago
Risk Sensitive Reinforcement Learning
In this paper, we consider Markov Decision Processes (MDPs) with error states. Error states are those states entering which is undesirable or dangerous. We define the risk with re...
Ralph Neuneier, Oliver Mihatsch
CVPR
2009
IEEE
1517views Computer Vision» more  CVPR 2009»
17 years 1 months ago
Linear Solution to Scale and Rotation Invariant Object Matching
Images of an object undergoing ego- or camera- motion often appear to be scaled, rotated, and deformed versions of each other. To detect and match such distorted patterns to a s...
Hao Jiang, Stella X. Yu