Sciweavers

1096 search results - page 130 / 220
» Using Prior Knowledge: Problems and Solutions
Sort
View
116
Voted
CP
2000
Springer
15 years 7 months ago
Analysis of Random Noise and Random Walk Algorithms
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
Bhaskar Krishnamachari, Xi Xie, Bart Selman, Steph...
102
Voted
IJCAI
2001
15 years 4 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
118
Voted
ALT
2008
Springer
16 years 14 days ago
Active Learning in Multi-armed Bandits
In this paper we consider the problem of actively learning the mean values of distributions associated with a finite number of options (arms). The algorithms can select which opti...
András Antos, Varun Grover, Csaba Szepesv&a...
91
Voted
ASPDAC
2000
ACM
95views Hardware» more  ASPDAC 2000»
15 years 7 months ago
Fair watermarking techniques
Many intellectual property protection (IPP) techniques have been proposed. Their primary objectives are providing convincible proof of authorship with least degradation of the qua...
Gang Qu, Jennifer L. Wong, Miodrag Potkonjak
147
Voted
IPCO
2007
108views Optimization» more  IPCO 2007»
15 years 5 months ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...