Sciweavers

71228 search results - page 13981 / 14246
» Algorithms
Sort
View
CONSTRAINTS
2006
105views more  CONSTRAINTS 2006»
15 years 6 months ago
Symmetry Breaking Constraints for Value Symmetries in Constraint Satisfaction
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...
Y. Law, J. Lee
COR
2006
82views more  COR 2006»
15 years 6 months ago
Batching work and rework processes with limited deterioration of reworkables
We study the problem of planning the production of new and recovering defective items of the same product manufactured on the same facility. Items of the product are produced in b...
Karl Inderfurth, Adam Janiak, Mikhail Y. Kovalyov,...
CORR
2006
Springer
145views Education» more  CORR 2006»
15 years 6 months ago
Algebraic Signal Processing Theory
In [1], we presented the algebraic signal processing theory, an axiomatic and general framework for linear signal processing. The basic concept in this theory is the signal model d...
Markus Püschel, José M. F. Moura
CORR
2006
Springer
109views Education» more  CORR 2006»
15 years 6 months ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
CORR
2006
Springer
125views Education» more  CORR 2006»
15 years 6 months ago
Barriers and local minima in energy landscapes of stochastic local search
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
Petteri Kaski
« Prev « First page 13981 / 14246 Last » Next »