3946 search results - page 381 / 790 » The computational complexity of choice sets |
204
click to vote
EGC
2005
Springer
16 years 1 months ago
2005
Springer
We are concerned with the following problem: How do we allow a community of users to access and process diverse data stored in many different formats? Standard data formats and da...
184
click to vote
IMR
2004
Springer
16 years 28 days ago
2004
Springer
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
219
Voted
ECRTS
2010
IEEE
15 years 7 months ago
2010
IEEE
—In distributed real-time embedded systems (DRE), it is common to model an application as a set of task chains. Each chain is activated cyclically and must complete before an end...
210
click to vote
CAD
2008
Springer
15 years 7 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
199
click to vote
IGPL
1998
15 years 7 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...