Sciweavers

1686 search results - page 53 / 338
» Programs as polygraphs: computability and complexity
Sort
View
IPPS
2002
IEEE
15 years 2 months ago
Generating Parallel Programs from the Wavefront Design Pattern
Object-oriented programming, design patterns, and frameworks are common techniques that have been used to reduce the complexity of sequential programming. We have applied these te...
John Anvik, Steve MacDonald, Duane Szafron, Jonath...
DAGM
2003
Springer
15 years 2 months ago
Learning Human-Like Opponent Behavior for Interactive Computer Games
Compared to their ancestors in the early 1970s, present day computer games are of incredible complexity and show magnificent graphical performance. However, in programming intelli...
Christian Bauckhage, Christian Thurau, Gerhard Sag...
ICS
2010
Tsinghua U.
15 years 2 months ago
Overlapping communication and computation by using a hybrid MPI/SMPSs approach
– Communication overhead is one of the dominant factors that affect performance in high-performance computing systems. To reduce the negative impact of communication, programmers...
Vladimir Marjanovic, Jesús Labarta, Eduard ...
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
15 years 1 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
PPPJ
2006
ACM
15 years 3 months ago
Enabling Java mobile computing on the IBM Jikes research virtual machine
Today’s complex applications must face the distribution of data and code among different network nodes. Java is a wide-spread language that allows developers to build complex so...
Giacomo Cabri, Letizia Leonardi, Raffaele Quitadam...