3221 search results - page 475 / 645 » Termination of Linear Programs |
168
click to vote
ASPLOS
1992
ACM
15 years 10 months ago
1992
ACM
: In scalable parallel machines, processors can make local memory accesses much faster than they can make remote memory accesses. In addition, when a number of remote accesses must...
169
click to vote
ECAI
1992
Springer
15 years 10 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
164
click to vote
ICALP
1990
Springer
15 years 10 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
159
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Security in multiagent systems is commonly defined as the ability of the system to deal with intentional threats from other agents. This paper focuses on domains where such intent...
150
click to vote
CC
2006
Springer
15 years 10 months ago
2006
Springer
Commonly-used memory units enable a processor to load and store multiple registers in one instruction. We showed in 2003 how to extend gcc with a stack-location-allocation (SLA) ph...