3946 search results - page 296 / 790 » The computational complexity of choice sets |
192
click to vote
VMCAI
2010
Springer
16 years 4 months ago
2010
Springer
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
186
click to vote
ERSHOV
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider the problem of query containment for conjunctive queries with safe negation property. A necessary and sufficient condition for two queries to be in containmen...
166
click to vote
GRAPHITE
2004
ACM
16 years 6 days ago
2004
ACM
A novel algorithm is presented that overcomes limitations of existing shadow volume algorithms when dealing with nonmanifold geometry and space partitioning. This simple algorithm...
176
click to vote
ISPDC
2003
IEEE
16 years 1 days ago
2003
IEEE
The paper presents a Java-based object-oriented system that offers a layered infrastructure to create the adequate framework for complex interactions between Grid components (e.g....
114
click to vote
CCE
2008
15 years 6 months ago
2008
In the present attempt a set of experiments and a 3D simulation using a commercially available computational fluid dynamics package (FLUENT) were adopted to investigate complex beh...