Sciweavers

3571 search results - page 456 / 715
» On the Power of Imperfect Information
Sort
View
FCCM
1999
IEEE
134views VLSI» more  FCCM 1999»
15 years 11 months ago
Runlength Compression Techniques for FPGA Configurations
The time it takes to reconfigure FPGAs can be a significant overhead for reconfigurable computing. In this paper we develop new compression algorithms for FPGA configurations that...
Scott Hauck, William D. Wilson
NGITS
1999
Springer
15 years 11 months ago
From Object-Process Diagrams to a Natural Object-Process Language
As the requirements for system analysis and design become more complex, the need for a natural, yet formal way of specifying system analysis findings and design decisions are becom...
Mor Peleg, Dov Dori
DASFAA
2007
IEEE
165views Database» more  DASFAA 2007»
15 years 10 months ago
Making the Most of Cache Groups
Cache groups are a powerful concept for database caching, which is used to relieve the backend database load and to keep referenced data close to the application programs at the &q...
Andreas Bühmann, Theo Härder
ICAIL
2007
ACM
15 years 10 months ago
The Ontology of Legal Possibilities and Legal Potentialities
Ontologies in a legal expert system must be processed to suit all possible user cases within the field of law of the system. From the logical premises of a deductive system of expr...
Pamela N. Gray
COCO
1991
Springer
93views Algorithms» more  COCO 1991»
15 years 10 months ago
Relating Equivalence and Reducibility to Sparse Sets
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
Eric Allender, Lane A. Hemachandra, Mitsunori Ogiw...