Sciweavers

2343 search results - page 212 / 469
» Visual-Concept Search Solved
Sort
View
JAIR
2010
145views more  JAIR 2010»
15 years 5 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
EOR
2010
140views more  EOR 2010»
15 years 4 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
Osman Oguz
SCHEDULING
2010
57views more  SCHEDULING 2010»
15 years 2 months ago
Scheduling technicians and tasks in a telecommunications company
This paper proposes a construction heuristic and an adaptive large neighborhood search heuristic for the technician and task scheduling problem arising in a large telecommunicatio...
Jean-François Cordeau, Gilbert Laporte, Fed...
AAAI
2011
14 years 7 months ago
Adaptive Neighborhood Inverse Consistency as Lookahead for Non-Binary CSPs
Freuder and Elfe (1996) introduced Neighborhood Inverse Consistency (NIC) for binary CSPs. In this paper, we introduce RNIC, the extension of NIC to nonbinary CSPs, and describe a...
Robert J. Woodward, Shant Karakashian, Berthe Y. C...
CVPR
2009
IEEE
17 years 2 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...