7820 search results - page 226 / 1564 » Formalization of Time and Space |
208
click to vote
ISAAC
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items, respectively) arrive over time, which must be p...
193
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
219
click to vote
SIGGRAPH
1997
ACM
15 years 11 months ago
1997
ACM
Manipulation in immersive virtual environments is difficult partly because users must do without the haptic contact with real objects they rely on in the real world to orient them...
188
click to vote
APVIS
2008
15 years 8 months ago
2008
We present a technique for memory-efficient and time-efficient volume rendering of curvilinear adaptive mesh refinement data defined within extrudable computational spaces. One of...
227
click to vote
BPM
2008
Springer
15 years 9 months ago
2008
Springer
A given business process may face a large number of regulatory obligations the process may or comply with. Providing tools and techniques through which an evaluation of the complia...