default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmile H. L. Aarts
- > Home > Persons > Emile H. L. Aarts
Publications
- 2018
[r2]Wil Michiels, Emile H. L. Aarts, Jan H. M. Korst:
Theory of Local Search. Handbook of Heuristics 2018: 299-339- 2012
- [j49]Wil Michiels, Emile H. L. Aarts, Jan H. M. Korst, Jan van Leeuwen, Frits C. R. Spieksma
:
Computer-assisted proof of performance ratios for the Differencing Method. Discret. Optim. 9(1): 1-16 (2012) - [c42]Natasa Jovanovic, Jan H. M. Korst, Zharko Aleksovski, Wil Michiels, Johan Lukkien, Emile H. L. Aarts:
Finding Shadows among Disks. CCCG 2012: 89-94 - 2007
- [b3]Wil Michiels, Emile H. L. Aarts, Jan H. M. Korst:
Theoretical aspects of local search. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2007, ISBN 978-3-540-35853-4, pp. I-VIII, 1-235 - [j38]Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen:
Performance ratios of the Karmarkar-Karp differencing method. J. Comb. Optim. 13(1): 19-32 (2007) - [r1]Jan H. M. Korst, Emile H. L. Aarts, Wil Michiels:
Simulated Annealing. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2005
- [p1]Emile H. L. Aarts, Jan H. M. Korst, Wim F. J. Verhaegh:
Algorithms in Ambient Intelligence. Ambient Intelligence 2005: 349-373 - 2003
- [j35]Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen:
Performance Ratios for the Karmarkar-Karp Differencing Method. Electron. Notes Discret. Math. 13: 71-75 (2003) - [c26]Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen:
Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem. STACS 2003: 583-595 - 1998
- [j31]Jan H. M. Korst, Verus Pronk, Pascal Coumans, Giel van Doren, Emile H. L. Aarts:
Comparing disk scheduling algorithms for VBR data streams. Comput. Commun. 21(15): 1328-1343 (1998) - 1997
- [j27]Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra:
Scheduling Periodic Tasks with Slack. INFORMS J. Comput. 9(4): 351-362 (1997) - 1996
- [j24]Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra:
Scheduling Periodic Tasks. INFORMS J. Comput. 8(4): 428-435 (1996) - [j23]Babette van Antwerpen-de Fluiter, Emile H. L. Aarts, Jan H. M. Korst, Wim F. J. Verhaegh, Albert van der Werf:
The complexity of generalized retiming problems. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15(11): 1340-1353 (1996) - 1995
- [j19]Wim F. J. Verhaegh, Paul E. R. Lippens, Emile H. L. Aarts, Jan H. M. Korst, Jef L. van Meerbergen, Albert van der Werf:
Improved force-directed scheduling in high-throughput digital signal processing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 14(8): 945-960 (1995) - 1994
- [j18]Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels:
Periodic Assignment and Graph Colouring. Discret. Appl. Math. 51(3): 291-305 (1994) - 1992
- [c14]Wim F. J. Verhaegh, Paul E. R. Lippens, Emile H. L. Aarts, Jan H. M. Korst, Albert van der Werf, Jef L. van Meerbergen:
Efficiency improvements for force-directed scheduling. ICCAD 1992: 286-291 - 1991
- [j9]Emile H. L. Aarts, Jan H. M. Korst:
Boltzmann Machines as a Model for Parallel Annealing. Algorithmica 6(3): 437-465 (1991) - [j7]Emile H. L. Aarts, F. M. J. de Bont, Jan H. M. Korst, J. M. J. Rongen:
An efficient macro-cell placement algorithm. Integr. 10(3): 299-317 (1991) - [c10]Wim F. J. Verhaegh, Emile H. L. Aarts, Jan H. M. Korst, Paul E. R. Lippens:
Improved force-directed scheduling. EURO-DAC 1991: 430-435 - [c9]Gerben Essink, Emile H. L. Aarts, R. van Dongen, Piet J. van Gerwen, Jan H. M. Korst, Kees A. Vissers:
Scheduling in Programmable Video Signal Processors. ICCAD 1991: 284-287 - [c8]Gerben Essink, Emile H. L. Aarts, R. van Dongen, Piet J. van Gerwen, Jan H. M. Korst, Kees A. Vissers:
Architecture and Programming of a VLIW Style Programmable Video Signal Processor. MICRO 1991: 181-188 - [c7]Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra, Jaap Wessels:
Periodic Multiprocessor Scheduling. PARLE (1) 1991: 166-178 - 1990
- [b2]Emile H. L. Aarts, Jan H. M. Korst:
Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing. Wiley-Interscience series in discrete mathematics and optimization, Wiley 1990, ISBN 978-0-471-92146-2, pp. I-XII, 1-272 - 1989
- [j3]Jan H. M. Korst, Emile H. L. Aarts:
Combinatorial Optimization on a Boltzmann Machine. J. Parallel Distributed Comput. 6(2): 331-357 (1989) - [j2]Emile H. L. Aarts, Jan H. M. Korst:
Computations in massively parallel networks based on the Boltzmann machine: a review. Parallel Comput. 9(2): 129-145 (1989) - 1987
- [c4]Emile H. L. Aarts, Jan H. M. Korst:
Boltzmann Machines and their Applications. PARLE (1) 1987: 34-50
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-07-02 21:25 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:
