Sciweavers

301 search results - page 14 / 61
» An efficient algorithm to verify generalized false paths
Sort
View
EOR
2008
75views more  EOR 2008»
13 years 8 months ago
GRASP and path relinking for project scheduling under partially renewable resources
Recently, in the field of project scheduling problems the concept of partially renewable resources has been introduced. Theoretically, it is a generalization of both renewable and...
Ramón Alvarez-Valdés, Enric Crespo, ...
TACAS
1998
Springer
98views Algorithms» more  TACAS 1998»
14 years 20 days ago
Efficient Modeling of Memory Arrays in Symbolic Ternary Simulation
This paper enables symbolic ternary simulation of systems with large embedded memories. Each memory array is replaced with a behavioral model, where the number of symbolic variable...
Miroslav N. Velev, Randal E. Bryant
DAWAK
2005
Springer
14 years 2 months ago
Efficient Compression of Text Attributes of Data Warehouse Dimensions
This paper proposes the compression of data in Relational Database Management Systems (RDBMS) using existing text compression algorithms. Although the technique proposed is general...
Jorge Vieira, Jorge Bernardino, Henrique Madeira
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
14 years 8 months ago
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
James Cheng, Yiping Ke, Wilfred Ng, An Lu
CGO
2003
IEEE
14 years 3 days ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue