Results 81 to 90 of about 364 (127)

Parameterizing Block Treedepth by Bounded Depth Forest Deletion

Οι δομικές παράμετροι γραφημάτων διαδραματίζουν κεντρικό ρόλο στη σύγχρονη Θεωρία Γραφημάτων και τον σχεδιασμό αλγορίθμων. Παρέχουν έναν τρόπο μέτρησης της δομικής πολυπλοκότητας των γραφημάτων και συχνά επιτρέπουν σε υπολογιστικά δύσκολα προβλήματα να καταστούν επιλύσιμα όταν η παράμετρος είναι μικρή. Στο πλαίσιο της Παραμετρικής Πολυπλοκότητας, πολλά
openaire   +1 more source

The successor representation subserves hierarchical abstraction for goal-directed behavior. [PDF]

PLoS Comput Biol
Wientjes S, Holroyd CB.
europepmc   +1 more source

The Seven-parameter Diffusion Model: an Implementation in Stan for Bayesian Analyses. [PDF]

Behav Res Methods
Henrich F, Hartmann R, Pratz V, Voss A, Klauer KC.   +4 more
europepmc   +1 more source

A tutorial for estimating Bayesian hierarchical mixture models for visual working memory tasks: Introducing the Bayesian Measurement Modeling (bmm) package for R. [PDF]

Behav Res Methods
Frischkorn GT, Popov V.
europepmc   +1 more source

The impact of kinship composition on social structure

Pereira AS, Pavez-Fox MA, Hart JDA, Negron-Del Valle JE, Phillips D, Casanova C, De Moor D, Brent LJN.   +7 more
europepmc   +1 more source

Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity [PDF]

Lecture Notes in Computer Science, 2021
For intractable problems on graphs of bounded treewidth, two graph parameters treedepth and vertex cover number have been used to obtain fine-grained complexity results.
Tesshu Hanaka, Yota Otachi, Masashi Kiyomi   +2 more
exaly   +4 more sources

Integer Programming and Incidence Treedepth [PDF]

Lecture Notes in Computer Science, 2019
Recently a strong connection has been shown between the tractability of integer programming (IP) with bounded coefficients on the one side and the structure of its constraint matrix on the other side.
Michał Pilipczuk, Marcin Wrochna, Robert Ganian   +2 more
exaly   +6 more sources