skip to main content
Language:
Primo Advanced Search
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search prefilters

Results 1 - 20 of 2,837  for All Library Resources

Results 1 2 3 4 5 next page
Show only
Result Number Material Type Add to My Shelf Action Record Details and Options
1
Optimal Static and Self-Adjusting Parameter Choices for the ( 1 + ( λ , λ ) ) Genetic Algorithm
Material Type:
Article
Add to My Research

Optimal Static and Self-Adjusting Parameter Choices for the ( 1 + ( λ , λ ) ) Genetic Algorithm

Algorithmica, 2018-05, Vol.80, p.1658-1709 [Peer Reviewed Journal]

Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-017-0354-9

Digital Resources/Online E-Resources

2
Finding Temporal Paths Under Waiting Time Constraints
Material Type:
Article
Add to My Research

Finding Temporal Paths Under Waiting Time Constraints

Algorithmica, 2021-09, Vol.83 (9), p.2754-2802 [Peer Reviewed Journal]

The Author(s) 2021 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-021-00831-w

Digital Resources/Online E-Resources

3
A Survey of Traffic Prediction: from Spatio-Temporal Data to Intelligent Transportation
Material Type:
Article
Add to My Research

A Survey of Traffic Prediction: from Spatio-Temporal Data to Intelligent Transportation

Data Science and Engineering, 2021-03, Vol.6 (1), p.63-85 [Peer Reviewed Journal]

The Author(s) 2021 ;COPYRIGHT 2021 Springer ;The Author(s) 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;ISSN: 2364-1185 ;EISSN: 2364-1541 ;DOI: 10.1007/s41019-020-00151-z

Full text available

4
Multiplicative Drift Analysis
Material Type:
Article
Add to My Research

Multiplicative Drift Analysis

Algorithmica, 2012-12, Vol.64 (4), p.673-697 [Peer Reviewed Journal]

Springer Science+Business Media, LLC 2012 ;Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-012-9622-x

Full text available

5
Temporal Network Optimization Subject to Connectivity Constraints
Material Type:
Article
Add to My Research

Temporal Network Optimization Subject to Connectivity Constraints

Algorithmica, 2019-04, Vol.81 (4), p.1416-1449 [Peer Reviewed Journal]

The Author(s) 2018 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-018-0478-6

Digital Resources/Online E-Resources

6
Publisher Correction: Longest Common Substring with Approximately k Mismatches
Material Type:
Article
Add to My Research

Publisher Correction: Longest Common Substring with Approximately k Mismatches

Algorithmica, 2023-10, Vol.85 (10), p.3323-3323 [Peer Reviewed Journal]

The Author(s) 2023 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-023-01119-x

Digital Resources/Online E-Resources

7
The Runtime of the Compact Genetic Algorithm on Jump Functions
Material Type:
Article
Add to My Research

The Runtime of the Compact Genetic Algorithm on Jump Functions

Algorithmica, 2021-10, Vol.83 (10), p.3059-3107 [Peer Reviewed Journal]

Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-020-00780-w

Digital Resources/Online E-Resources

8
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Material Type:
Article
Add to My Research

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem

Algorithmica, 2021-01, Vol.83 (1), p.297-336 [Peer Reviewed Journal]

The Author(s) 2020 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-020-00758-8

Digital Resources/Online E-Resources

9
Compact Distributed Certification of Planar Graphs
Material Type:
Article
Add to My Research

Compact Distributed Certification of Planar Graphs

Algorithmica, 2021-07, Vol.83 (7), p.2215-2244 [Peer Reviewed Journal]

Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-021-00823-w

Digital Resources/Online E-Resources

10
A Rigorous Runtime Analysis of the $$(1 + (\lambda , \lambda ))$$ GA on Jump Functions
Material Type:
Article
Add to My Research

A Rigorous Runtime Analysis of the $$(1 + (\lambda , \lambda ))$$ GA on Jump Functions

Algorithmica, 2022-06 [Peer Reviewed Journal]

Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-021-00907-7

Digital Resources/Online E-Resources

11
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Material Type:
Article
Add to My Research

Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage

Algorithmica, 2024-03, Vol.86 (3), p.874-906 [Peer Reviewed Journal]

The Author(s) 2023 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-023-01149-5

Digital Resources/Online E-Resources

12
On the Tractability of Optimization Problems on H-Graphs
Material Type:
Article
Add to My Research

On the Tractability of Optimization Problems on H-Graphs

Algorithmica, 2020-09, Vol.82 (9), p.2432-2473 [Peer Reviewed Journal]

The Author(s) 2020 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-020-00692-9

Digital Resources/Online E-Resources

13
Deep Learning for User Interest and Response Prediction in Online Display Advertising
Material Type:
Article
Add to My Research

Deep Learning for User Interest and Response Prediction in Online Display Advertising

Data Science and Engineering, 2020-03, Vol.5 (1), p.12-26 [Peer Reviewed Journal]

The Author(s) 2020 ;COPYRIGHT 2020 Springer ;ISSN: 2364-1185 ;EISSN: 2364-1541 ;DOI: 10.1007/s41019-019-00115-y

Full text available

14
Big Data Reduction Methods: A Survey
Material Type:
Article
Add to My Research

Big Data Reduction Methods: A Survey

Data science and engineering, 2016-12, Vol.1 (4), p.265-284 [Peer Reviewed Journal]

The Author(s) 2016 ;The Author(s) 2016. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;ISSN: 2364-1185 ;EISSN: 2364-1541 ;DOI: 10.1007/s41019-016-0022-0

Full text available

15
Traversability, Reconfiguration, and Reachability in the Gadget Framework
Material Type:
Article
Add to My Research

Traversability, Reconfiguration, and Reachability in the Gadget Framework

Algorithmica, 2023-11, Vol.85 (11), p.3453-3486 [Peer Reviewed Journal]

The Author(s) 2023 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-023-01140-0

Digital Resources/Online E-Resources

16
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
Material Type:
Article
Add to My Research

On vanishing sums of roots of unity in polynomial calculus and sum-of-squares

Computational complexity, 2023-12, Vol.32 (2) [Peer Reviewed Journal]

The Author(s) 2023 ;ISSN: 1016-3328 ;EISSN: 1420-8954 ;DOI: 10.1007/s00037-023-00242-z

Digital Resources/Online E-Resources

17
GARG: Anonymous Recommendation of Point-of-Interest in Mobile Networks by Graph Convolution Network
Material Type:
Article
Add to My Research

GARG: Anonymous Recommendation of Point-of-Interest in Mobile Networks by Graph Convolution Network

Data Science and Engineering, 2020-12, Vol.5 (4), p.433-447 [Peer Reviewed Journal]

The Author(s) 2020 ;COPYRIGHT 2020 Springer ;ISSN: 2364-1185 ;EISSN: 2364-1541 ;DOI: 10.1007/s41019-020-00135-z

Full text available

18
Black-Box Search by Unbiased Variation
Material Type:
Article
Add to My Research

Black-Box Search by Unbiased Variation

Algorithmica, 2012-12, Vol.64 (4), p.623-642 [Peer Reviewed Journal]

Springer Science+Business Media, LLC 2012 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-012-9616-8

Full text available

19
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems
Material Type:
Article
Add to My Research

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems

Algorithmica, 2023-05, Vol.85 (5), p.1251-1286 [Peer Reviewed Journal]

The Author(s) 2022 ;ISSN: 0178-4617 ;EISSN: 1432-0541 ;DOI: 10.1007/s00453-022-01066-z

Digital Resources/Online E-Resources

20
A Survey on Advancing the DBMS Query Optimizer: Cardinality Estimation, Cost Model, and Plan Enumeration
Material Type:
Article
Add to My Research

A Survey on Advancing the DBMS Query Optimizer: Cardinality Estimation, Cost Model, and Plan Enumeration

Data Science and Engineering, 2021-03, Vol.6 (1), p.86-101 [Peer Reviewed Journal]

The Author(s) 2021 ;COPYRIGHT 2021 Springer ;The Author(s) 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;ISSN: 2364-1185 ;EISSN: 2364-1541 ;DOI: 10.1007/s41019-020-00149-7

Full text available

Results 1 - 20 of 2,837  for All Library Resources

Results 1 2 3 4 5 next page

Personalize your results

  1. Edit

Refine Search Results

Expand My Results

  1.   

Show only

  1. Peer-reviewed Journals (2,374)

Refine My Results

Creation Date 

From To
  1. Before 1989  (35)
  2. 1989 To 1997  (136)
  3. 1998 To 2006  (1,024)
  4. 2007 To 2016  (1,318)
  5. After 2016  (597)
  6. More options open sub menu

Resource Type 

  1. Articles  (1,578)
  2. Books  (1,044)
  3. Conference Proceedings  (191)
  4. Web Resources  (17)
  5. Book Chapters  (6)
  6. Text Resources  (1)
  7. More options open sub menu

Language 

  1. English  (2,826)
  2. Japanese  (138)
  3. Spanish  (16)
  4. French  (10)
  5. German  (9)
  6. Italian  (2)
  7. Norwegian  (1)
  8. More options open sub menu

Searching Remote Databases, Please Wait