Sciweavers

454 search results - page 70 / 91
» On improving approximate solutions by evolutionary algorithm...
Sort
View
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 11 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
ESTIMEDIA
2003
Springer
15 years 6 months ago
Perception Coprocessors for Embedded Systems
Recognizing speech, gestures, and visual features are important interface capabilities for embedded mobile systems. Perception algorithms have many traits in common with more conv...
Binu K. Mathew, Al Davis, Ali Ibrahim
AAAI
2010
15 years 2 months ago
Symbolic Dynamic Programming for First-order POMDPs
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
Scott Sanner, Kristian Kersting
GECCO
2009
Springer
15 years 8 months ago
On the scalability of XCS(F)
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
Patrick O. Stalph, Martin V. Butz, David E. Goldbe...
CVPR
2006
IEEE
15 years 7 months ago
Active Graph Cuts
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
Olivier Juan, Yuri Boykov