Sciweavers

6456 search results - page 78 / 1292
» Constraint Solving on Terms
Sort
View
ICASSP
2011
IEEE
14 years 4 months ago
Regularized split gradient method for nonnegative matrix factorization
This article deals with a regularized version of the split gradient method (SGM), leading to multiplicative algorithms. The proposed algorithm is available for the optimization of...
Henri Lantéri, Céline Theys, C&eacut...
99
Voted
CORR
1998
Springer
105views Education» more  CORR 1998»
15 years 21 days ago
Solving Degenerate Sparse Polynomial Systems Faster
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
J. Maurice Rojas
AAAI
1996
15 years 2 months ago
Agent Cooperation Can Compensate For Agent Ignorance in Constraint Satisfaction
A team of constraint agents with diverse viewpoints canfind a solution to a constraint satisfaction problem (CSP) whenthe individual agents have an incomplete viewof the problem.I...
Peggy S. Eaton, Eugene C. Freuder
ICML
2006
IEEE
16 years 1 months ago
Qualitative reinforcement learning
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
Arkady Epshteyn, Gerald DeJong
99
Voted
PPDP
2005
Springer
15 years 6 months ago
Heuristics, optimizations, and parallelism for protein structure prediction in CLP(FD)
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
Alessandro Dal Palù, Agostino Dovier, Enric...