Sciweavers

1617 search results - page 150 / 324
» Constraints in Weighted Averaging
Sort
View
79
Voted
IJCAI
1993
15 years 2 months ago
Domain Filtering can Degrade Intelligent Backtracking Search
This paper presents an improved backjumping algonthm for the constraint satisfaction problem, namely conflictdirected backjumping (CBJ). CBJ is then modified such that it can dete...
Patrick Prosser
ICASSP
2010
IEEE
15 years 1 months ago
Ergodic stochastic optimization algorithms for wireless communication and networking
— Ergodic stochastic optimization (ESO) algorithms are proposed to solve resource allocation problems that involve a random state and where optimality criteria are expressed in t...
Alejandro Ribeiro
130
Voted
EMNLP
2011
14 years 17 days ago
Dual Decomposition with Many Overlapping Components
Dual decomposition has been recently proposed as a way of combining complementary models, with a boost in predictive power. However, in cases where lightweight decompositions are ...
André L. Martins, Noah A. Smith, Már...
84
Voted
CHI
2001
ACM
16 years 1 months ago
Ignoring perfect knowledge in-the-world for imperfect knowledge in-the-head
Constraints and dependencies among the elements of embodied cognition form patterns or microstrategies of interactive behavior. Hard constraints determine which microstrategies ar...
Wayne D. Gray, Wai-Tat Fu
135
Voted
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
15 years 4 months ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson