Sciweavers

1344 search results - page 59 / 269
» Problem Solving with Adaptive Feedback
Sort
View
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 9 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
TSP
2010
13 years 3 months ago
Generalized adaptive notch smoothing revisited
The problem of identification of quasi-periodically varying dynamic systems is considered. This problem can be solved using generalized adaptive notch filtering (GANF) algorithms. ...
Maciej Niedzwiecki
AI
2006
Springer
13 years 9 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
AAAI
2011
12 years 8 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...
SCAI
1993
13 years 10 months ago
A Case-Based Answer to Some Problems of Knowledge-Based Systems
Among the most important challenges for contemporary AI research are the development of methods for improved robustness, adaptability, and overall interactiveness of systems. Inter...
Agnar Aamodt