Sciweavers

335 search results - page 41 / 67
» Collaborative Learning for Constraint Solving
Sort
View
CPAIOR
2007
Springer
15 years 6 months ago
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
Wafa Karoui, Marie-José Huguet, Pierre Lope...
SIGITE
2004
ACM
15 years 5 months ago
Implementation of object-orientation using UML in entry level software development courses
In this paper, we establish the need (based on literature and anecdotal evidence) for an infrastructure for CS1 courses to visually support problem solving from the initial proble...
Mohammad H. N. Tabrizi, Carol B. Collins, E. Ozan,...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 5 days ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
ECAI
2004
Springer
15 years 5 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière
CP
2007
Springer
15 years 6 months ago
On Universal Restart Strategies for Backtracking Search
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
Huayue Wu, Peter van Beek