Sciweavers

4860 search results - page 438 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
WEBI
2005
Springer
15 years 9 months ago
Measuring the Relative Performance of Schema Matchers
Schema matching is a complex process focusing on matching between concepts describing the data in heterogeneous data sources. There is a shift from manual schema matching, done by...
Shlomo Berkovsky, Yaniv Eytani, Avigdor Gal
CSCLP
2003
Springer
15 years 9 months ago
Implementing Propagators for Tabular Constraints
Many real-life constraints describing relations between the problem variables have complex semantics and the constraint domain is defined using a table of compatible tuples rather ...
Roman Barták, Roman Mecl
113
Voted
DSN
2002
IEEE
15 years 9 months ago
Evaluation of the Maximum Level Reached by a Queue Over a Finite Period
This paper deals with the performance analysis of a system modeled by a queue. If we are interested in occupation problems and if we look at the transient phase, then it makes sen...
Gerardo Rubino
DAC
1998
ACM
15 years 8 months ago
Global Routing with Crosstalk Constraints
—Due to the scaling down of device geometry and increasing of frequency in deep submicron designs, crosstalk between interconnection wires has become an important issue in very l...
Hai Zhou, D. F. Wong
EPIA
1993
Springer
15 years 8 months ago
Resolution of Constraints in Algebras of Rational Trees
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
Luís Damas, Nelma Moreira, Sabine Broda