2517 search results - page 124 / 504 » Specifying Weak Sets |
146
click to vote
SIGGRAPH
1991
ACM
15 years 9 months ago
1991
ACM
A major problem challenging opera designers is the inability to coordinate lighting, projection systems, and set designs in the preliminary planning phase. New computer graphics t...
182
click to vote
IJCAI
1997
15 years 6 months ago
1997
We address the problem of introducing preferences into default logic. Two approaches are given, one a generalisation of the other. In the first approach, an ordered default theory...
162
click to vote
DLT
2009
15 years 3 months ago
2009
A famous theorem of Kuratowski states that, in a topological space, at most 14 distinct sets can be produced by repeatedly applying the operations of closure and complement to a gi...
161
Voted
JOC
2000
15 years 5 months ago
2000
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
143
click to vote
TCS
2008
15 years 5 months ago
2008
From an engineering point of view, the problem of coordinating a set of autonomous, mobile robots for the purpose of cooperatively performing a task has been studied extensively o...