Sciweavers

3600 search results - page 497 / 720
» The settling-time reducibility ordering
Sort
View
ICTAI
2000
IEEE
15 years 10 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche
MICRO
2000
IEEE
95views Hardware» more  MICRO 2000»
15 years 10 months ago
Very low power pipelines using significance compression
Data, addresses, and instructions are compressed by maintaining only significant bytes with two or three extension bits appended to indicate the significant byte positions. This s...
Ramon Canal, Antonio González, James E. Smi...
QOFIS
2000
Springer
15 years 10 months ago
On ACK Filtering on a Slow Reverse Channel
ACK filtering has been proposed as a technique to alleviate the congestion at the input of a slow channel located on the reverse path of a TCP connection. Old ACKs waiting at the ...
Chadi Barakat, Eitan Altman
WEBDB
2000
Springer
136views Database» more  WEBDB 2000»
15 years 10 months ago
An Optimization Technique for Answering Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
Gösta Grahne, Alex Thomo
EURODAC
1995
IEEE
164views VHDL» more  EURODAC 1995»
15 years 10 months ago
Bottleneck removal algorithm for dynamic compaction and test cycles reduction
: We present a new, dynamic algorithm for test sequence compaction and test cycle reduction for combinationaland sequential circuits. Several dynamic algorithms for compaction in c...
Srimat T. Chakradhar, Anand Raghunathan