Sciweavers

307 search results - page 58 / 62
» Finite locally-quasiprimitive graphs
Sort
View
JSYML
2002
170views more  JSYML 2002»
14 years 11 months ago
Representability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
Gian Aldo Antonelli, Richmond H. Thomason
141
Voted
CPAIOR
2010
Springer
14 years 9 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
16 years 1 days ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
81
Voted
VVS
1998
IEEE
106views Visualization» more  VVS 1998»
15 years 3 months ago
An Exact Interactive Time Visibility Ordering Algorithm for Polyhedral Cell Complexes
A visibility ordering of a set of objects, from a given viewpoint, is a total order on the objects such that if object a obstructs object b, then b precedes a in the ordering. Suc...
Cláudio T. Silva, Joseph S. B. Mitchell, Pe...
136
Voted
CONCUR
1998
Springer
15 years 3 months ago
Algebraic Techniques for Timed Systems
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
Albert Benveniste, Claude Jard, Stephane Gaubert