Sciweavers

CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 9 months ago
Parameterized Complexity Results in Symmetry Breaking
Abstract. Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues...
Toby Walsh
CIKM
2010
Springer
13 years 9 months ago
Evaluating, combining and generalizing recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...
Aditya G. Parameswaran, Hector Garcia-Molina, Jeff...
AUTOMATICA
1999
62views more  AUTOMATICA 1999»
13 years 10 months ago
Complexity of stability and controllability of elementary hybrid systems
In this paper, we consider simple classes of nonlinear systems and prove that basic questions related to their stability and controllability are either undecidable or computationa...
Vincent D. Blondel, John N. Tsitsiklis
IJCAI
1989
13 years 12 months ago
Using and Refining Simplifications: Explanation-Based Learning of Plans in Intractable Domains
This paper describes an explanation-based approach lo learning plans despite a computationally intractable domain theory. In this approach, the system learns an initial plan using...
Steve A. Chien
FLAIRS
1998
14 years 4 days ago
Discovering Heuristic Strategy for Solving Scheduling Problems
Optimallysolving a scheduling problemis computationally intractable, hencevarieties of techniques and methodshave been explored to obtain sub-optimal solutions to such problems. I...
Rasiah Loganantharaj