Sciweavers

34 search results - page 3 / 7
» Local-search Extraction of MUSes
Sort
View
TSMC
2011
324views more  TSMC 2011»
13 years 1 months ago
Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
Shengxiang Yang, Sadaf Naseem Jat
WWW
2008
ACM
14 years 7 months ago
A differential notion of place for local search
For extracting the characteristics a specific geographic entity, and notably a place, we propose to use dynamic Extreme Tagging Systems in combination with the classic approach of...
Vlad Tanasescu, John Domingue
SAT
2005
Springer
129views Hardware» more  SAT 2005»
14 years 5 days ago
On Finding All Minimally Unsatisfiable Subformulas
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
Mark H. Liffiton, Karem A. Sakallah
SEMWEB
2007
Springer
14 years 24 days ago
Ontology-Based Information Extraction for Business Intelligence
Abstract. Business Intelligence (BI) requires the acquisition and aggregation of key pieces of knowledge from multiple sources in order to provide valuable information to customers...
Horacio Saggion, Adam Funk, Diana Maynard, Kalina ...
JAR
2008
81views more  JAR 2008»
13 years 6 months ago
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable "cores" from unsatisfiable constraint systems with the goal...
Mark H. Liffiton, Karem A. Sakallah