default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYori Zwols
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i6]Vinod Nair, Sergey Bartunov, Felix Gimeno
, Ingrid von Glehn, Pawel Lichocki, Ivan Lobov, Brendan O'Donoghue, Nicolas Sonnerat, Christian Tjandraatmadja, Pengming Wang, Ravichandra Addanki, Tharindi Hapuarachchi, Thomas Keck, James Keeling, Pushmeet Kohli, Ira Ktena, Yujia Li, Oriol Vinyals, Yori Zwols:
Solving Mixed Integer Programs Using Neural Networks. CoRR abs/2012.13349 (2020)
2010 – 2019
- 2019
- [c4]Lars Buesing, Theophane Weber, Yori Zwols, Nicolas Heess, Sébastien Racanière, Arthur Guez, Jean-Baptiste Lespiau:
Woulda, Coulda, Shoulda: Counterfactually-Guided Policy Search. ICLR (Poster) 2019 - 2018
- [c3]Marco Fraccaro, Danilo Jimenez Rezende, Yori Zwols, Alexander Pritzel, S. M. Ali Eslami, Fabio Viola:
Generative Temporal Models with Spatial Memory for Partially Observed Environments. ICML 2018: 1544-1553 - [i5]Marco Fraccaro, Danilo Jimenez Rezende, Yori Zwols, Alexander Pritzel, S. M. Ali Eslami, Fabio Viola:
Generative Temporal Models with Spatial Memory for Partially Observed Environments. CoRR abs/1804.09401 (2018) - [i4]Lars Buesing, Theophane Weber, Yori Zwols, Sébastien Racanière, Arthur Guez, Jean-Baptiste Lespiau, Nicolas Heess:
Woulda, Coulda, Shoulda: Counterfactually-Guided Policy Search. CoRR abs/1811.06272 (2018) - 2017
- [i3]Chrisantha Fernando, Dylan Banarse, Charles Blundell, Yori Zwols, David Ha, Andrei A. Rusu, Alexander Pritzel, Daan Wierstra:
PathNet: Evolution Channels Gradient Descent in Super Neural Networks. CoRR abs/1701.08734 (2017) - 2016
- [j11]Alex Graves, Greg Wayne, Malcolm Reynolds, Tim Harley, Ivo Danihelka, Agnieszka Grabska-Barwinska, Sergio Gomez Colmenarejo, Edward Grefenstette, Tiago Ramalho, John P. Agapiou, Adrià Puigdomènech Badia, Karl Moritz Hermann, Yori Zwols, Georg Ostrovski, Adam Cain, Helen King, Christopher Summerfield, Phil Blunsom, Koray Kavukcuoglu, Demis Hassabis:
Hybrid computing using a neural network with dynamic external memory. Nat. 538(7626): 471-476 (2016) - 2015
- [j10]Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols:
A De Bruijn-Erdős Theorem for Chordal Graphs. Electron. J. Comb. 22(1): 1 (2015) - [j9]Dariusz Dereniowski, Wieslaw Kubiak, Yori Zwols:
The complexity of minimum-length path decompositions. J. Comput. Syst. Sci. 81(8): 1715-1747 (2015) - [i2]Peter Sunehag, Richard Evans, Gabriel Dulac-Arnold, Yori Zwols, Daniel Visentin, Ben Coppin:
Deep Reinforcement Learning with Attention for Slate Markov Decision Processes with High-Dimensional States and Actions. CoRR abs/1512.01124 (2015) - 2013
- [j8]Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols:
Lines in hypergraphs. Comb. 33(6): 633-654 (2013) - [j7]Dariusz Dereniowski, Wieslaw Kubiak, Bernard Ries, Yori Zwols:
Optimal edge-coloring with edge rate constraints. Networks 62(3): 165-182 (2013) - [i1]Dariusz Dereniowski, Wieslaw Kubiak, Yori Zwols:
Minimum length path decompositions. CoRR abs/1302.2788 (2013) - 2012
- [j6]Maria Chudnovsky, Yori Zwols:
Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement. J. Graph Theory 70(4): 449-472 (2012) - [j5]Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols:
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. IEEE/ACM Trans. Netw. 20(1): 163-176 (2012) - 2011
- [j4]Maria Chudnovsky, Bernard Ries, Yori Zwols:
Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs. Discret. Appl. Math. 159(17): 1971-1995 (2011) - [j3]Maria Chudnovsky, Bernard Ries, Yori Zwols:
Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures. Discret. Appl. Math. 159(17): 1996-2029 (2011) - 2010
- [j2]Yori Zwols:
K4-free graphs with no odd hole: Even pairs and the circular chromatic number. J. Graph Theory 65(4): 303-322 (2010) - [c2]Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols:
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. INFOCOM 2010: 2213-2221 - [c1]Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols:
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory. S3@MobiCom 2010: 17-20
2000 – 2009
- 2009
- [j1]Yori Zwols, Gerard Sierksma:
OR Practice - Training Optimization for the Decathlon. Oper. Res. 57(4): 812-822 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
