Sciweavers

189 search results - page 34 / 38
» Similarity-Guided Clause Generalization
Sort
View
INFOCOM
2000
IEEE
13 years 10 months ago
Heuristic Algorithms for Joint Configuration of the Optical and Electrical Layer in Multi-Hop Wavelength Routing Networks
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...
Tibor Cinkler, Dániel Marx, Claus Popp Lars...
AIPS
2006
13 years 8 months ago
Lemma Reusing for SAT based Planning and Scheduling
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
Hidetomo Nabeshima, Takehide Soh, Katsumi Inoue, K...
ICAI
2003
13 years 8 months ago
Threshold Behavior in a Boolean Network Model for SAT
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
Alejandro Bugacov, Aram Galstyan, Kristina Lerman
KRDB
2003
111views Database» more  KRDB 2003»
13 years 8 months ago
A Framework for Answering Queries using Multiple Representation and Inference Techniques
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
Nicholas L. Cassimatis
AAAI
1993
13 years 8 months ago
Finding Accurate Frontiers: A Knowledge-Intensive Approach to Relational Learning
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
Michael J. Pazzani, Clifford Brunk