Sciweavers

1686 search results - page 251 / 338
» Programs as polygraphs: computability and complexity
Sort
View
110
Voted
VRML
1997
ACM
15 years 5 months ago
V-COLLIDE: Accelerated Collision Detection for VRML
Collision detection is essential for many applications involving simulation, behavior and animation. However, it has been regarded as a computationallydemanding task and is often ...
Thomas C. Hudson, Ming C. Lin, Jonathan D. Cohen, ...
129
Voted
ICS
1993
Tsinghua U.
15 years 5 months ago
Dynamic Control of Performance Monitoring on Large Scale Parallel Systems
Performance monitoring of large scale parallel computers creates a dilemma: we need to collect detailed information to find performance bottlenecks, yet collecting all this data ...
Jeffrey K. Hollingsworth, Barton P. Miller
EUROPAR
2004
Springer
15 years 4 months ago
Imprecise Exceptions in Distributed Parallel Components
Abstract. Modern microprocessors have sacrificed the exactness of exceptions for improved performance long ago. This is a side effect of reordering instructions so that the micropr...
Kostadin Damevski, Steven G. Parker
78
Voted
KR
2000
Springer
15 years 4 months ago
Finding Admissible and Preferred Arguments Can be Very Hard
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
111
Voted
HPCN
1995
Springer
15 years 4 months ago
Discrete optimisation and real-world problems
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
Josef Kallrath, Anna Schreieck