Backtracking - PDFSEARCH.IO - Document Search Engine

Backtracking
Results: 159

#	Item
101	Binary vs. Non-Binary Constraints Fahiem Bacchus Department of Computer Science University of Toronto Toronto, Canada [removed] Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2006-01-21 00:43:15 Computer programming Constraint satisfaction problem Local consistency Hidden transformation Constraint satisfaction Constraint graph Boolean satisfiability problem Hidden variable Backtracking Constraint programming Software engineering Theoretical computer science
102	Constraints[removed]:372–406 DOI[removed]s10601[removed]y New algorithms for max restricted path consistency Thanasis Balafoutis · Anastasia Paparrizou · Kostas Stergiou · Toby Walsh Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2011-11-10 00:37:14 Computing Local consistency Constraint satisfaction problem Decomposition method Constraint satisfaction Mathematical optimization Backtracking Algorithm AC-3 algorithm Constraint programming Software engineering Computer programming
103	This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution and shar Add to Reading List Source URL: www.ece.neu.edu Language: English - Date: 2012-10-07 15:19:25 Computer programming Constraint satisfaction Search algorithm Algorithm Mathematical optimization Local consistency Backtracking Greedy algorithm Control theory Constraint programming Mathematics Software engineering
104	Guiding Planner Backjumping Using Verifier Traces Add to Reading List Source URL: aaai.org Language: English - Date: 2006-01-11 07:53:49 Artificial intelligence Search algorithms Complexity classes Backjumping Backtracking Constraint satisfaction problem Model checking NP IP Theoretical computer science Applied mathematics Constraint programming
105	From: AAAI-87 Proceedings. Copyright ©1987, AAAI (www.aaai.org). All rights reserved. Explanation-Based Ajay Faillure Add to Reading List Source URL: aaai.org Language: English - Date: 2006-01-09 19:15:42 Computing Programming paradigms Educational psychology Neuropsychological assessment Problem solving Logic programming Prolog Backtracking Constraint logic programming Software engineering Constraint programming Computer programming
106	Backtracking Counterfactuals and iterated modalities Ana Arregui - University of Ottawa Backtracking counterfactuals are counterfactuals that claim that if things had been different at some time t, they would also have b Add to Reading List Source URL: www.cssp.cnrs.fr Language: English - Date: 2010-11-22 10:35:33 Science Semantics Conditionals Possibility Linguistic modality Counterfactual conditional Accessibility relation Possible world Auxiliary verb Logic Modal logic Philosophical logic
107	Graph Coloring Algorithms∗ Walter Klotz Abstract Deterministic graph coloring algorithms of contraction and sequential type are investigated. Sequential algorithms can be extended by backtracking to Add to Reading List Source URL: www.math.tu-clausthal.de Language: English Graph Neighbourhood Clique Degeneracy List coloring Graph theory Mathematics Graph coloring
108	Controlling the Back Button in SeaSide Avi Bryant and Stéphane Ducasse Seaside is a framework for developing sophisticated web applications in Smalltalk. Its most unique feature is its approach to session management: un Add to Reading List Source URL: sdmeta.gforge.inria.fr Language: English - Date: 2014-10-22 14:44:22 Seaside Smalltalk Visual programming languages Squeak BackTrack Backtracking Java Servlet Computing Software engineering Computer programming
109	To appear in Mathematical Programming[removed]The original article is available at http://www.springerlink.com Active-Constraint Variable Ordering for Faster Feasibility of Mixed Integer Linear Programs Jagat Patel Add to Reading List Source URL: www.sce.carleton.ca Language: English - Date: 2006-06-28 11:21:37 Applied mathematics Combinatorial optimization Constraint programming Linear programming relaxation Linear programming Relaxation Branch and bound Backtracking Candidate solution Operations research Mathematical optimization Mathematics
110	Preprint. Reference for final version: Computers and Operations Research, vol. 37, no. 9, pp[removed]Faster MIP Solutions via New Node Selection Rules Daniel T. Wojtaszek Add to Reading List Source URL: www.sce.carleton.ca Language: English - Date: 2012-04-04 15:37:43 Mathematics Search algorithms Backtracking Pattern matching Linear programming relaxation Branch and bound Feature selection Tree Mathematical optimization Combinatorial optimization Operations research

UPDATE