![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Isaac Meilijson
Person information
- affiliation: Tel Aviv University, School of Mathematical Sciences, Israel
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j26]Noam Goldberg, Isaac Meilijson
, Yael Perlman
:
Dynamic history-dependent tax and environmental compliance monitoring of risk-averse firms. Ann. Oper. Res. 334(1): 469-495 (2024) - 2023
- [j25]Refael Hassin
, Isaac Meilijson
, Yael Perlman
:
Queueing with Negative Network Effects. Manuf. Serv. Oper. Manag. 25(5): 1984-1998 (2023)
2010 – 2019
- 2016
- [c11]Benoît Groz, Ezra Levin, Isaac Meilijson, Tova Milo:
Filtering With the Crowd: CrowdScreen Revisited. ICDT 2016: 12:1-12:18 - [i1]Tal Galili, Isaac Meilijson:
Splitting matters: how monotone transformation of predictor variables may improve the predictions of decision tree models. CoRR abs/1611.04561 (2016) - 2011
- [j24]Tim Bedford, Isha Dewan, Isaac Meilijson, Athena Zitrou:
The signal model: A model for competing risks of opportunistic maintenance. Eur. J. Oper. Res. 214(3): 665-673 (2011) - [j23]Shlomi Reuveni
, Isaac Meilijson, Martin Kupiec, Eytan Ruppin, Tamir Tuller
:
Genome-Scale Analysis of Translation Elongation with a Ribosome Flow Model. PLoS Comput. Biol. 7(9) (2011) - [c10]Shlomi Reuveni
, Isaac Meilijson, Martin Kupiec, Eytan Ruppin, Tamir Tuller:
A Ribosome Flow Model for Analyzing Translation Elongation - (Extended Abstract). RECOMB 2011: 358-360
2000 – 2009
- 2008
- [j22]David Deutscher, Isaac Meilijson, Stefan Schuster, Eytan Ruppin:
Can single knockouts accurately single out gene functions? BMC Syst. Biol. 2: 50 (2008) - 2006
- [j21]Alon Keinan, Ben Sandbank, Claus C. Hilgetag
, Isaac Meilijson, Eytan Ruppin:
Axiomatic Scalable Neurocontroller Analysis via the Shapley Value. Artif. Life 12(3): 333-352 (2006) - [j20]Alon Kaufman, Gideon Dror, Isaac Meilijson, Eytan Ruppin:
Gene Expression of Caenorhabditis elegans Neurons Carries Information on Their Synaptic Connectivity. PLoS Comput. Biol. 2(12) (2006) - 2005
- [j19]Alon Kaufman, Alon Keinan, Isaac Meilijson, Martin Kupiec, Eytan Ruppin:
Quantitative Analysis of Genetic and Neuronal Multi-Perturbation Experiments. PLoS Comput. Biol. 1(6) (2005) - 2004
- [j18]Alon Keinan, Claus C. Hilgetag
, Isaac Meilijson, Eytan Ruppin:
Causal localization of neural function: the Shapley value method. Neurocomputing 58-60: 215-222 (2004) - [j17]Alon Keinan, Ben Sandbank, Claus C. Hilgetag
, Isaac Meilijson, Eytan Ruppin:
Fair Attribution of Functional Contribution in Artificial and Biological Networks. Neural Comput. 16(9): 1887-1915 (2004) - 2003
- [j16]Lior Segev, Ranit Aharonov-Barki, Isaac Meilijson, Eytan Ruppin:
High-Dimensional Analysis of Evolutionary Autonomous Agents. Artif. Life 9(1): 1-20 (2003) - [j15]Ranit Aharonov-Barki, Lior Segev, Isaac Meilijson, Eytan Ruppin:
Localization of Function via Lesion Analysis. Neural Comput. 15(4): 885-913 (2003) - [j14]Roger M. Cooke, Dorota Kurowicka, Isaac Meilijson:
Linearization of local probabilistic sensitivity via sample re-weighting. Reliab. Eng. Syst. Saf. 79(2): 131-137 (2003) - 2002
- [j13]Yael Niv, Daphna Joel
, Isaac Meilijson, Eytan Ruppin:
Evolution of Reinforcement Learning in Uncertain Environments: A Simple Explanation for Complex Foraging Behaviors. Adapt. Behav. 10(1): 5-24 (2002) - [j12]Yael Niv, Daphna Joel
, Isaac Meilijson, Eytan Ruppin:
Evolution of reinforcement learning in foraging bees: a simple explanation for risk averse behavior. Neurocomputing 44-46: 951-956 (2002) - 2001
- [j11]Gal Chechik
, Isaac Meilijson, Eytan Ruppin:
Effective Neuronal Learning with Ineffective Hebbian Learning Rules. Neural Comput. 13(4): 817-840 (2001) - [j10]Nir Levy, David Horn
, Isaac Meilijson, Eytan Ruppin:
Distributed synchrony in a cell assembly of spiking neurons. Neural Networks 14(6-7): 815-824 (2001) - [c9]Ranit Aharonov-Barki, Isaac Meilijson, Eytan Ruppin:
Understanding the Agent's Brain: A Quantitative Approach. ECAL 2001: 216-225 - [c8]Yael Niv, Daphna Joel
, Isaac Meilijson, Eytan Ruppin:
Evolution of Reinforcement Learning in Uncertain Environments: Emergence of Risk-Aversion and Matching. ECAL 2001: 252-261 - 2000
- [j9]Gal Chechik
, Isaac Meilijson, Eytan Ruppin:
Neuronal normalization provides effective learning through ineffective synaptic learning rules. Neurocomputing 32-33: 345-351 (2000) - [c7]Ranit Aharonov-Barki, Isaac Meilijson, Eytan Ruppin:
Who Does What? A Novel Algorithm to Determine Function Localization. NIPS 2000: 3-9
1990 – 1999
- 1999
- [j8]Gal Chechik
, Isaac Meilijson, Eytan Ruppin:
Neuronal regulation: A biologically plausible mechanism for efficient synaptic pruning in development. Neurocomputing 26-27: 633-639 (1999) - [j7]Gal Chechik, Isaac Meilijson, Eytan Ruppin:
Neuronal Regulation: A Mechanism for Synaptic Pruning During Brain Maturation. Neural Comput. 11(8): 2061-2080 (1999) - [c6]Gal Chechik, Isaac Meilijson, Eytan Ruppin:
Effective Learning Requires Neuronal Remodeling of Hebbian Synapses. NIPS 1999: 96-102 - [c5]David Horn, Nir Levy, Isaac Meilijson, Eytan Ruppin:
Distributed Synchrony of Spiking Neurons in a Hebbian Cell Assembly. NIPS 1999: 129-135 - 1998
- [j6]Gal Chechik, Isaac Meilijson, Eytan Ruppin:
Synaptic Pruning In Development: A Computational Account. Neural Comput. 10(7): 1759-1777 (1998) - [c4]Gal Chechik, Isaac Meilijson, Eytan Ruppin:
Neuronal Regulation Implements Efficient Synaptic Pruning. NIPS 1998: 97-103 - [p1]Isaac Meilijson, Eytan Ruppin, Moshe Sipper:
Fast computation in hamming and hopfield networks. Algorithms and Architectures 1998: 123-154 - 1996
- [j5]Isaac Meilijson, Eytan Ruppin:
Optimal firing in sparsely-connected low-activity attractor networks. Biol. Cybern. 74(6): 479-485 (1996) - 1995
- [j4]Isaac Meilijson, Eytan Ruppin, Moshe Sipper
:
A single-iteration threshold Hamming network. IEEE Trans. Neural Networks 6(1): 261-266 (1995) - 1994
- [j3]Michael Landsberger, Isaac Meilijson:
Co-monotone allocations, Bickel-Lehmann dispersion and the Arrow-Pratt measure of risk aversion. Ann. Oper. Res. 52(2): 97-106 (1994) - 1993
- [c3]Isaac Meilijson, Eytan Ruppin:
Optimal Signalling in Attractor Neural Networks. NIPS 1993: 485-492 - 1992
- [c2]Isaac Meilijson, Eytan Ruppin, Moshe Sipper:
Single-Iteration Threshold Hamming Networks. NIPS 1992: 564-571 - [c1]Isaac Meilijson, Eytan Ruppin:
History-Dependent Attractor Neural Networks. NIPS 1992: 572-579
1980 – 1989
- 1984
- [j2]Isaac Meilijson, A. Tamir:
Minimizing Flow Time on Parallel Identical Processors with Variable Unit Processing Time. Oper. Res. 32(2): 440-448 (1984) - [j1]M. Keane, Alan G. Konheim, Isaac Meilijson:
The Organ Pipe Permutation. SIAM J. Comput. 13(3): 531-540 (1984)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-29 22:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint