Sciweavers

256 search results - page 30 / 52
» Comparison of Heuristic and Optimal Subcarrier Assignment Al...
Sort
View
IJCAI
1989
13 years 9 months ago
Constraint Satisfiability Algorithms for Interactive Student Scheduling
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
Ronen Feldman, Martin Charles Golumbic
WEBI
2005
Springer
14 years 2 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
SMI
2008
IEEE
127views Image Analysis» more  SMI 2008»
14 years 3 months ago
Optimal bandwidth selection for MLS surfaces
We address the problem of bandwidth selection in MLS surfaces. While the problem has received relatively little attention in the literature, we show that appropriate selection pla...
Hao Wang, Carlos Eduardo Scheidegger, Cláud...
HASE
1998
IEEE
14 years 29 days ago
Optimal Discrimination between Transient and Permanent Faults
An important practical problem in fault diagnosis is discriminating between permanent faults and transient faults. In many computer systems, the majority of errors are due to tran...
M. Pizza, Lorenzo Strigini, Andrea Bondavalli, Fel...
RECOMB
2005
Springer
14 years 9 months ago
Reversals of Fortune
Abstract. The objective function of the genome rearrangement problems allows the integration of other genome-level problems so that they may be solved simultaneously. Three example...
David Sankoff, Chunfang Zheng, Aleksander Lenert