Sciweavers

143 search results - page 16 / 29
» Combination of Among and Cardinality Constraints
Sort
View
FLAIRS
2007
14 years 1 months ago
Random Subsets Support Learning a Mixture of Heuristics
Problem solvers, both human and machine, have at their disposal many heuristics that may support effective search. The efficacy of these heuristics, however, varies with the probl...
Smiljana Petrovic, Susan L. Epstein
WSC
2007
14 years 1 months ago
Agent-based simulations of service policy decisions
During service engagements, project managers frequently encounter resource constraint issues. For each resource shortfall encountered, a project manager must decide among a narrow...
Richard B. Lam
NIPS
2004
14 years 8 days ago
Nonparametric Transforms of Graph Kernels for Semi-Supervised Learning
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...
Xiaojin Zhu, Jaz S. Kandola, Zoubin Ghahramani, Jo...
AIPS
1994
14 years 7 days ago
A Framework for Automatic Problem Decomposition in Planning
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
Qiang Yang, Shuo Bai, Guiyou Qiu
ICCV
2011
IEEE
12 years 11 months ago
Image Segmentation by Figure-Ground Composition into Maximal Cliques
We propose a mid-level statistical model for image segmentation that composes multiple figure-ground hypotheses (FG) obtained by applying constraints at different locations and s...
Adrian Ion, Joao Carreira, Cristian Sminchisescu