150 search results - page 20 / 30 » Parameterized Modal Satisfiability |
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
A mathematical formula containing one or more free variables is "general" in the sense that it represents the solution to all instances of a problem (instead of just the...
AUTOMATICA
2008
13 years 7 months ago
2008
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
CGF
2008
13 years 7 months ago
2008
We present a generic framework for compression of densely sampled 3D surfaces in order to satisfy the increasing demand for storing large amounts of 3D content. We decompose a giv...
DAM
2006
13 years 7 months ago
2006
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
IM
2007
13 years 7 months ago
2007
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...