Sciweavers

1333 search results - page 174 / 267
» Not a Number of Floating Point Problems
Sort
View
ICCAD
2007
IEEE
87views Hardware» more  ICCAD 2007»
16 years 1 months ago
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
—Register allocation, in high-level synthesis and ASIP design, is the process of determining the number of registers to include in the resulting circuit or processor. The goal is...
Philip Brisk, Ajay K. Verma, Paolo Ienne
SEMWEB
2009
Springer
15 years 10 months ago
Parallel Materialization of the Finite RDFS Closure for Hundreds of Millions of Triples
In this paper, we consider the problem of materializing the complete finite RDFS closure in a scalable manner; this includes those parts of the RDFS closure that are often ignored...
Jesse Weaver, James A. Hendler
IAT
2008
IEEE
15 years 10 months ago
Introducing Communication in Dis-POMDPs with Locality of Interaction
The Networked Distributed POMDPs (ND-POMDPs) can model multiagent systems in uncertain domains and has begun to scale-up the number of agents. However, prior work in ND-POMDPs has ...
Makoto Tasaki, Yuichi Yabu, Yuki Iwanari, Makoto Y...
BROADNETS
2007
IEEE
15 years 10 months ago
Strategic deployment of network monitors for attack attribution
—Attacks launched over the Internet have become a pressing problem. Attackers make use of a variety of techniques to anonymize their traffic, in order to escape detection and pr...
Young June Pyun, Douglas S. Reeves
GLOBECOM
2007
IEEE
15 years 10 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu