Sciweavers

5263 search results - page 19 / 1053
» Open Constraint Optimization
Sort
View
CVPR
2009
IEEE
15 years 10 months ago
Optimal scanning for faster object detection
Recent years have seen the development of fast and accurate algorithms for detecting objects in images. However, as the size of the scene grows, so do the running-times of these a...
Nicholas J. Butko, Javier R. Movellan
127
Voted
CPAIOR
2007
Springer
15 years 9 months ago
A Position-Based Propagator for the Open-Shop Problem
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
Jean-Noël Monette, Yves Deville, Pierre Dupon...
ICCSA
2003
Springer
15 years 8 months ago
The p-th Order Necessary Optimality Conditions for Inequality-Constrained Optimization Problems
Abstract. In this paper, we consider a nonlinear optimization problem with inequality constraints. The paper addresses the degenerate case when the active constraint gradients are ...
Olga Brezhneva, Alexey Tret'yakov
IJAR
2011
86views more  IJAR 2011»
14 years 6 months ago
On open questions in the geometric approach to structural learning Bayesian nets
The basic idea of an algebraic approach to learning Bayesian network (BN) structures is to represent every BN structure by a certain uniquely determined vector, called the standar...
Milan Studený, Jirí Vomlel
SAT
2004
Springer
109views Hardware» more  SAT 2004»
15 years 8 months ago
A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints
The problem of solving boolean combinations of difference constraints is at the core of many important techniques such as planning, scheduling, and model-checking of real-time syst...
Alessandro Armando, Claudio Castellini, Enrico Giu...