603 search results - page 70 / 121 » A General Approximation Technique for Constrained Forest Pro... |
102
click to vote
NIPS
2007
15 years 1 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
112
click to vote
IJCAI
2001
15 years 1 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
111
click to vote
KDD
2008
ACM
16 years 8 days ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
DAC
2005
ACM
16 years 25 days ago
2005
ACM
Signal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little ...