Sciweavers

6618 search results - page 1059 / 1324
» Natural Logic for Natural Language
Sort
View
IANDC
2006
102views more  IANDC 2006»
15 years 6 months ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
JIKM
2008
98views more  JIKM 2008»
15 years 6 months ago
Knowledge-Based Expert System Development and Validation with Petri Nets
Expert systems (ESs) are complex information systems that are expensive to build and difficult to validate. Numerous knowledge representation strategies such as rules, semantic net...
Madjid Tavana
190
Voted
JUCS
2008
166views more  JUCS 2008»
15 years 6 months ago
ASM Refinement Preserving Invariants
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...
Gerhard Schellhorn
HEURISTICS
2002
99views more  HEURISTICS 2002»
15 years 6 months ago
Parallelizing Tabu Search on a Cluster of Heterogeneous Workstations
In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strate...
Ahmad A. Al-Yamani, Sadiq M. Sait, Habib Youssef, ...
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
15 years 6 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
« Prev « First page 1059 / 1324 Last » Next »