225 search results - page 33 / 45 » From polynomial time queries to graph structure theory |
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
JCO
2011
14 years 4 months ago
2011
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
93
Voted
KDD
2007
ACM
15 years 10 months ago
2007
ACM
The blogosphere has unique structural and temporal properties since blogs are typically used as communication media among human individuals. In this paper, we propose a novel tech...
GIS
2007
ACM
15 years 1 months ago
2007
ACM
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
DBPL
1993
Springer
15 years 1 months ago
1993
Springer
Fox Finding Objects of eXperiments is the declarative query language for Moose Modeling Objects Of Scienti c Experiments , an object-oriented data model at the core of a scient...