Sciweavers

1546 search results - page 187 / 310
» Thoughts on solution concepts
Sort
View
ICDT
2010
ACM
161views Database» more  ICDT 2010»
14 years 1 months ago
Data Correspondence, Exchange, and Repair
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical ...
Gösta Grahne, Adrian Onet
ICDT
2010
ACM
193views Database» more  ICDT 2010»
14 years 2 days ago
Data correspondence, exchange and repair
Checking the correspondence between two or more database instances and enforcing it is a procedure widely used in practice without however having been explored from a theoretical ...
Gösta Grahne, Adrian Onet
CPAIOR
2008
Springer
13 years 11 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
CN
2006
85views more  CN 2006»
13 years 9 months ago
A scalable and decentralized fast-rerouting scheme with efficient bandwidth sharing
This paper focuses on the protection of virtual circuits (Label Switched Paths, LSPs) in a (G)MPLS (Generalised Multi-Protocol Label Switching) network. The proposed algorithm is ...
Simon Balon, Laurent Mélon, Guy Leduc
BMCBI
2007
128views more  BMCBI 2007»
13 years 9 months ago
Model order selection for bio-molecular data clustering
Background: Cluster analysis has been widely applied for investigating structure in bio-molecular data. A drawback of most clustering algorithms is that they cannot automatically ...
Alberto Bertoni, Giorgio Valentini