Sciweavers

3818 search results - page 411 / 764
» Learning from Order Examples
Sort
View
SOFSEM
2010
Springer
16 years 1 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour
CIKM
2008
Springer
15 years 6 months ago
Trada: tree based ranking function adaptation
Machine Learned Ranking approaches have shown successes in web search engines. With the increasing demands on developing effective ranking functions for different search domains, ...
Keke Chen, Rongqing Lu, C. K. Wong, Gordon Sun, La...
AIEDAM
2011
14 years 11 months ago
Discovering implicit constraints in design
In familiar design domains, expert designers are able to quickly focus on “good designs”, based on constraints they have learned while exploring the design space. This ability ...
Madan Mohan Dabbeeru, Amitabha Mukerjee
EUROGRAPHICS
2010
Eurographics
16 years 1 months ago
Synthesis of Responsive Motion Using a Dynamic Model
Synthesizing the movements of a responsive virtual character in the event of unexpected perturbations has proven a difficult challenge. To solve this problem, we devise a fully a...
Yuting Ye and C. Karen Liu
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
15 years 9 months ago
Is negative selection appropriate for anomaly detection?
Negative selection algorithms for hamming and real-valued shape-spaces are reviewed. Problems are identified with the use of these shape-spaces, and the negative selection algori...
Thomas Stibor, Philipp H. Mohr, Jonathan Timmis, C...