• No results found

Results and Algorithms

Complexity results and algorithms for possibilistic influence diagrams

Complexity results and algorithms for possibilistic influence diagrams

... complexity results about several PID-related problems. These results enlighten the fact that optimistic optimisation problems are easier to solve than pessimistic ...elimination algorithms for ...

27

Fundamental Results on Asynchronous Parallel Optimization Algorithms

Fundamental Results on Asynchronous Parallel Optimization Algorithms

... was previously the fastest existing coordinate descent algorithm. Chapter 8 defines A2BCD, and states the main results of this part. In Chapter 9 , we prove that A2BCD attains NU_ACDM’s state-of-the-art iteration ...

137

CiteSeerX — Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems

CiteSeerX — Experimental Results on the Application of Satisfiability Algorithms to Scheduling Problems

... the results and algo- rithms developed will carry over to \real" constraint- satisfaction ...ability algorithms to scheduling ...best algorithms for this problem class will proba- bly be ...

7

Convergence results on greedy algorithms for high-dimensional
          eigenvalue problems*

Convergence results on greedy algorithms for high-dimensional eigenvalue problems*

... greedy algorithms for the computation of the lowest eigenstate of high- dimensional eigenvalue problems which were introduced and analyzed recently in ...theoretical results proved in the latter paper and ...

10

Graph Powers: Hardness Results, Good Characterizations and Efficient Algorithms. Dissertation

Graph Powers: Hardness Results, Good Characterizations and Efficient Algorithms. Dissertation

... These results together with results in Chapter 5 (Section ...theoretical results considerably generalize previous results on tree square ...our algorithms can be extended to compute ...

127

Comparing the Results of Support Vector Machines with Traditional Data Mining Algorithms

Comparing the Results of Support Vector Machines with Traditional Data Mining Algorithms

... different algorithms were employed in the current study, including completely automatic neural networks and CARTs, hand tuned logistic regression, and hand tuned ...the results would vary ...

5

Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs

Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs

... In this section, we give overviews of the proofs and algorithms behind our three main results. We start in Section 2.1 with our structural theorem about apex- minor-free graphs, which strengthens the ...

12

Language Independent System for Definition Extraction: First Results Using Learning Algorithms

Language Independent System for Definition Extraction: First Results Using Learning Algorithms

... learning algorithms and different sampling technique applied to a definition extraction task, using data sets in different ...our results with those obtained by hand- crafted rules to extract ...ing ...

7

Search Results: Predicting Ranking Algorithms With User Ratings and User-Driven Data

Search Results: Predicting Ranking Algorithms With User Ratings and User-Driven Data

... Data Collection Technique Data for this study was collected using an online survey. The questions on this survey gave the participant a search term and a website that would be presented with the given search term and ...

132

Re-evaluation of illuminant estimation algorithms in terms of reproduction results and failure cases

Re-evaluation of illuminant estimation algorithms in terms of reproduction results and failure cases

... estimation algorithms proposed over years and the fact that the topic is still of interest to the computer vision researchers today predi- cates the need to evaluate the performance of the ...estimation ...

186

Large Scale Global Optimization: Experimental Results with MOS-based Hybrid Algorithms

Large Scale Global Optimization: Experimental Results with MOS-based Hybrid Algorithms

... well-known algorithms, as well as a new variant of the first of the local searches of the MTS algorithm, which we have named MTS-LS1- Reduced, and a new DE variant combining the principles of the self-adaptation ...

8

OPTIMIZATION OF CONSECUTIVE SIGNALIZED INTERSECTIONS BASED ON COMBINED ALGORITHMS – COMPARING RESULTS WITH MICROSIMULATION

OPTIMIZATION OF CONSECUTIVE SIGNALIZED INTERSECTIONS BASED ON COMBINED ALGORITHMS – COMPARING RESULTS WITH MICROSIMULATION

... genetic algorithms (GA) and neural network (NN) with genetic algorithm (GA) were used and compared in order to optimize signal timing in consecutive signalized ...The results and comparisons of timing ...

17

CiteSeerX — Empirical Support for Winnow and Weighted-Majority Algorithms: Results on a Calendar Scheduling Domain

CiteSeerX — Empirical Support for Winnow and Weighted-Majority Algorithms: Results on a Calendar Scheduling Domain

... experimental results on using Winnow and Weighted-Majority based algorithms on a real-world calendar scheduling ...two algorithms have been highly studied in the theoretical machine learning ...these ...

19

Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation

Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation

... 6. Counterexample-Guided Abstraction Refinement In this section, we present algorithms for solving enforcement problems beyond NP, i.e., the Σ P 2 - complete problems of strict extension enforcement under the ...

40

Some Numerical Results on Function Space (Fsa) Algorithms

Some Numerical Results on Function Space (Fsa) Algorithms

... ABSTRACT In this work, we consider the numerical implementation of Function Space Algorithm (FSA) for the solution of quadratic continuous cost functional. It is used to solve Reaction Diffusion Control problems. It ...

14

Complexity results and exact algorithms for robust knapsack problems.

Complexity results and exact algorithms for robust knapsack problems.

... The results include the complexity and the approximation of the absolute robustness and the min-max regret criterion [4,12,13, 16, ...The results are extended to the general setting with uncertainty ...

26

Hardness results and approximation algorithms for (weighted) paired-domination in graphs

Hardness results and approximation algorithms for (weighted) paired-domination in graphs

... [11] G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi, Complexity and Approximation, Springer, Berlin, 1999. [12] D. Hochbaum, Approximation Algorithms for NP-Hard Problems, PWS ...

9

Some results on parallel iterative algorithms for strictly pseudocontractive mappings

Some results on parallel iterative algorithms for strictly pseudocontractive mappings

... above results, we consider an implicitly parallel itera- tive algorithm for a finite family of strictly pseudocontractive ...main results, we need the following conceptions and ...

10

New results on online job scheduling and data stream algorithms.

New results on online job scheduling and data stream algorithms.

... We first study space-efficient algorithms. The challenge is how to represent massive data volume in a window, while allowing certain statistics to be computed with sufficient accuracy. One fundamental problem is ...

16

Online graph exploration: New results on old and new algorithms

Online graph exploration: New results on old and new algorithms

... For general graphs with arbitrary weights no constant competitive algorithm is known. A promising candidate was introduced by Kalyanasundaram and Pruhs [ 30 ]. Their algorithm ShortCut is a sophisticated generalization ...

11

Show all 10000 documents...

Related subjects