Sponsored link
Plain ACS - American Chemical Society APA - American Psychological Association CBE - Council of Biology Editors Chicago Elsevier Harvard IEEE JAMA - Journal of American Medical Association MLA - Modern Language Association Nature Oxford Science Turabian Vancouver APA (Reed)
There are no reviews of this article
@inproceedings{citeulike:2708032, address = {Menlo Park, CA, USA}, author = {Kautz, Henry and Horvitz, Eric and Ruan, Yongshao and Gomes, Carla and Selman, Bart }, booktitle = {Eighteenth National Conference on Artificial Intelligence}, citeulike-article-id = {2708032}, isbn = {0262511290}, keywords = {restart\_strategies, satisfiability}, pages = {674--681}, posted-at = {2008-04-23 17:02:00}, priority = {0}, publisher = {American Association for Artificial Intelligence}, title = {Dynamic restart policies}, url = {http://portal.acm.org/citation.cfm?id=777092.777196}, year = {2002} }
TY - CONF ID - citeulike:2708032 L3 - citeulike-article-id:2708032 TI - Dynamic restart policies T2 - Eighteenth National Conference on Artificial Intelligence SP - 674 EP - 681 AD - Menlo Park, CA, USA PB - American Association for Artificial Intelligence SN - 0262511290 KW - restart_strategies KW - satisfiability AU - Kautz, Henry AU - Horvitz, Eric AU - Ruan, Yongshao AU - Gomes, Carla AU - Selman, Bart PY - 2002/// UR - http://portal.acm.org/citation.cfm?id=777092.777196 ER -
active_experts active_learning adaptive_adversarial adaptive_routing adversarial agnostic_learning algorithm_behavior algorithm_guidance algorithm_portfolios algorithm_selection allocation_rules anytime_algorithms auv_control auv_simulation bandit_problem bayes_filtering bayesian benchmarking best_expert boosting bounded_optimality bounded_rationality chess classic complete_search computational_complexity confidence_bounds correlation_length cryptography deadlines decision_problems disciplines dynamic_programming dynamic_schedules economics eira empirical_hardness evolution evolvability exploitation_exploration extreme_values finite_automata finite_time fitness_landscapes floating_point full_information game_playing game_theory gaussian_processes generation_gaps genetic_algorithms go godel heuristic_search hybrid_algorithms instance_aware internal_regret iterative_deepening kalman_filters kolmgorov_complexity label_efficient learning_theory least_squares lecture_notes levin_search linear_optimization localization local_search low_knowledge machine_learning market_portfolios markov_decision_processes masters_theses max_bandit max_sat membership_queries meta_algorithms meta_planning methodology metrical_tasks minimax_search model_selection monte_carlo multiplicative_weights nash_equilibria natural_gradient neat neural_networks neuroevolution nk_landscapes no_free_lunch no_regret np_completeness online_algorithms online_learning optimal_experiments optimal_schedules optimization pac_bounds pac_learning parameter_adjustment partial_information partially_observable performance_prediction perturbed_leader phd_theses physics planning policy_gradient population_dynamics predictive_state query_strategies random_walks reference regression reinforcement_learning remus restart_strategies rigid_body robotics robust_optimization rule_based satisfiability seminal shop_scheduling soar stage static_schedules statistical_learning statistics steady_state success-story survey symbol_systems tabu_search temporal_difference time_complexity trajectory_libraries treatment_allocation tree_search uct unscented_kalman walksat winner_determination with_noise worst_case