Sciweavers

4488 search results - page 106 / 898
» Focusing Search by Using Problem Solving Experience
Sort
View
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
15 years 10 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke
EUROPAR
2005
Springer
15 years 8 months ago
Soft Computing Approach to Performance Analysis of Parallel and Distributed Programs
This paper describes a novel approach to performance analysis for parallel and distributed systems that is based on soft computing. We introduce the concept of performance score re...
Hong Linh Truong, Thomas Fahringer
ICDE
2009
IEEE
216views Database» more  ICDE 2009»
15 years 1 months ago
Continuous Subgraph Pattern Search over Graph Streams
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
Changliang Wang, Lei Chen 0002
121
Voted
ICASSP
2009
IEEE
15 years 10 months ago
Using phase linearity in frequency-domain ICA to tackle the permutation problem
This paper describes a method for solving the permutation problem in the frequency-domain independent component analysis (FD-ICA) approach to blind source separation (BSS). FD-ICA...
Keisuke Toyama, Mark D. Plumbley
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 1 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise