Sciweavers

1095 search results - page 39 / 219
» Preprocessing of Intractable Problems
Sort
View
ICCAD
2003
IEEE
124views Hardware» more  ICCAD 2003»
14 years 4 months ago
Gradual Relaxation Techniques with Applications to Behavioral Synthesis
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
Zhiru Zhang, Yiping Fan, Miodrag Potkonjak, Jason ...
LATA
2009
Springer
14 years 2 months ago
From Gene Trees to Species Trees through a Supertree Approach
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez
DBPL
2005
Springer
130views Database» more  DBPL 2005»
14 years 1 months ago
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
VLDB
2000
ACM
146views Database» more  VLDB 2000»
13 years 11 months ago
A Database Platform for Bioinformatics
In recent years, new developments in genetics have generated a lot of interest in genomic and proteomic data, investing international significance (and competition) in the fledgli...
Sandeepan Banerjee
AAAI
1992
13 years 9 months ago
Causal Approximations
models require the identi cation of abstractions and approximations that are well suited to the task at hand. In this paper we analyze the problem of automatically selecting adequ...
P. Pandurang Nayak