5128 search results - page 355 / 1026 » When Abstraction Fails |
164
click to vote
LFP
1992
15 years 8 months ago
1992
We propose a syntactic approach to performing fixed point computation on finite domains. Finding fixed points in finite domains for monotonic functions is an essential task when c...
211
click to vote
CADE
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We introduce a semantics for classical logic with partial functions. We believe that the semantics is natural. When a formula contains a subterm in which a function is ap...
174
Voted
CEC
2010
IEEE
15 years 8 months ago
2010
IEEE
Abstract-- This paper presents a fast and reliable globalsearch approach to the problem of virtual camera positioning when multiple objects that need to be within the reach of the ...
201
click to vote
EUROPAR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. In this paper we consider the problem of scheduling on computing platforms composed of several independent organizations, known as the Multi-Organization Scheduling Probl...
168
click to vote
AICOM
2007
15 years 7 months ago
2007
Abstract. Tournament scheduling, such as the social golfer problem, has attracted significant attention in recent years because of their highly symmetrical and combinatorial natur...