Data and Decision Sciences

Research output

Research output per year 1969 2005 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024

• 1734 Article
• 824 Conference contribution
• 127 Chapter
• 101 Conference article
• 302 More
  • 76 Paper
  • 36 Editorial
  • 34 Review article
  • 32 Book
  • 26 Working paper
  • 22 Comment/debate
  • 21 Anthology
  • 17 Other contribution
  • 9 Letter
  • 7 Report
  • 6 Other
  • 6 Meeting Abstract
  • 6 Preprint
  • 2 Patent
  • 1 Foreword/postscript
  • 1 Short survey

Research output per year

Research output per year

Search results

• 2022

  A Compilation Based Approach to Finding Centroids and Minimum Covering States in Planning.

  Karpas, E., 2022, p. 174-178.

  Research output: Contribution to conference › Paper › peer-review

• Conflict-Directed Diverse Planning for Logic-Geometric Programming.

  Haro, J. O. D., Karpas, E., Toussaint, M. & Katz, M., 2022, p. 279-287.

  Research output: Contribution to conference › Paper › peer-review

• DoCoGen: Domain Counterfactual Generation for Low Resource Domain Adaptation

  Calderon, N., Ben-David, E., Feder, A. & Reichart, R., 1 Feb 2022, p. 7727-7746. 20 p.

  Research output: Contribution to conference › Paper › peer-review

  • Domain Adaptation 100%
  • Natural Language Processing 66%
  • Classifier 66%
  • Multiple Domain 33%
  • Unlabeled Example 33%

• Learning to Estimate Search Progress Using Sequence of States.

  Sudry, M. & Karpas, E., 2022, p. 362-370.

  Research output: Contribution to conference › Paper › peer-review

• On Covariate Shift of Latent Confounders in Imitation and Reinforcement Learning

  Tennenholtz, G., Hallak, A., Dalal, G., Mannor, S., Chechik, G. & Shalit, U., 2022.

  Research output: Contribution to conference › Paper › peer-review

  • Covariate 100%
  • Confounders 100%
  • Sampling Procedure 50%
  • Arbitrary Distribution 50%
  2 Scopus citations

• When to Commit to an Action in Online Planning and Search.

  Gu, T., Ruml, W., Shperberg, S. S., Shimony, S. E. & Karpas, E., 2022, p. 83-90.

  Research output: Contribution to conference › Paper › peer-review
• 2021

  Approximate Implication with d-Separation

  Kenig, B., 2021, p. 301-311. 11 p.

  Research output: Contribution to conference › Paper › peer-review

  • Approximates 100%
  • Graphical Model 100%
  • Conditional Independence 75%
  • Approximation (Algorithm) 25%
  • Graph Algorithms 25%

• Cognitive properties of norm representations

  Malle, B. F., Austerweil, J. L., Chi, V. B., N. Kenett, Y., Beck, E. D., Thapa, S. & Allaham, M., 2021, p. 819-826.

  Research output: Contribution to conference › Paper › peer-review

  • Specificity 100%
  • Behavior 50%

• Cognitive Properties of Norm Representations

  Malle, B. F., Austerweil, J. L., Chi, V. B., Kenett, Y. N., Beck, E. D., Thapa, S. & Allaham, M., 2021, p. 819-825. 7 p.

  Research output: Contribution to conference › Paper › peer-review

  • Specificity 100%
  • Behavior 50%
  4 Scopus citations

• DILBERT: Customized Pre-Training for Domain Adaptation withCategory Shift, with an Application to Aspect Extraction

  Lekhtman, E., Ziser, Y. & Reichart, R., 2021.

  Research output: Contribution to conference › Paper › peer-review

• Optimizing Memory Placement using Evolutionary Graph Reinforcement Learning

  Khadka, S., Aflalo, E., Marder, M., Ben-David, A., Miret, S., Mannor, S., Hazan, T., Tang, H. & Majumdar, S., 2021.

  Research output: Contribution to conference › Paper › peer-review

  • Reinforcement Learning 100%
  • Search Space 50%
  • Residual Neural Network 50%
  • Neural Network 50%
  • Speed-up 25%
  1 Scopus citations

• VoterFraud2020: a Multi-modal Dataset of Election Fraud Claims on Twitter

  Abilov, A., Hua, Y., Matatov, H., Amir, O. & Naaman, M., 2021.

  Research output: Contribution to conference › Paper › peer-review
• 2020

  Fast Stochastic Algorithms for Low-rank and Nonsmooth Matrix Problems

  Garber, D. & Kaplan, A., 2020.

  Research output: Contribution to conference › Paper › peer-review

  • Optimization Problem 100%
  • Convex Optimization 100%
  • Approximation (Algorithm) 100%
  • Machine Learning 100%
  • Efficient Algorithm 100%
  3 Scopus citations

• Let's Learn Their Language? A Case for Planning with Automata-Network Languages from Model Checking.

  Hoffmann, J., Hermanns, H., Klauck, M., Steinmetz, M., Karpas, E. & Magazzeni, D., 2020, p. 13569-13575.

  Research output: Contribution to conference › Paper › peer-review

• Logarithmic regret for online gradient descent beyond strong convexity

  Garber, D., 2020.

  Research output: Contribution to conference › Paper › peer-review

  • Polyhedral Set 100%
  • Loss Function 50%
  • Polytope 50%
  • Step Newton 50%
  • Stochastics 50%

• The Secretary Recommendation Problem

  Smorodinsky, R., Hoefer, M. & Hahn, N., 2020.

  Research output: Contribution to conference › Paper › peer-review

  • Optimization Problem 100%
  • Approximation (Algorithm) 100%
  • Decision-Making 100%
• 2019

  Towards Learning of Filter-Level Heterogeneous Compression of Convolutional Neural Networks

  Zur, Y., Baskin, C., Zheltonozhskii, E., Chmiel, B., Evron, I., Bronstein, A. & Mendelson, A., 2019.

  Research output: Contribution to conference › Paper

  • Convolutional Neural Network 100%
  • Neural Architecture Search 66%
  • Neural Network 66%
  • Search Space 33%
  • Deep Learning 33%
• 2018

  Efficient Crowdsourcing via Proxy Voting

  Cohensius, G., Porat, O. B., Meir, R. & Amir, O., 2018.

  Research output: Contribution to conference › Paper › peer-review

• Position paper: Reasoning about domains with PDDL

  Shleyfman, A. & Karpas, E., 2018, p. 582-586. 5 p.

  Research output: Contribution to conference › Paper › peer-review

  • Domain Definition 100%
  • Domain Description 50%
  • Use Case 16%
  • Mutual Exclusion 16%
  • Problem Description 16%
  1 Scopus citations

• Situated planning for execution under temporal constraints

  Cashmore, M., Coles, A., Cserna, B., Karpas, E., Magazzeni, D. & Ruml, W., 2018, p. 490-496. 7 p.

  Research output: Contribution to conference › Paper › peer-review

  • Execution Plan 100%
  • Time-Sensitive 100%
  • Timing Constraint 100%
  • Temporal Constraint 100%
  • Decision-Making 100%
  3 Scopus citations
• 2017

  Mixed discrete-continuous planning with convex optimization

  Fernández-González, E., Karpas, E. & Williams, B., 2017, p. 4574-4580. 7 p.

  Research output: Contribution to conference › Paper › peer-review

  • Convex Optimization 100%
  • Robot 100%
  • State Variable 100%
  • Continuous Change 100%
  • Robotics Application 50%
  12 Scopus citations

• Psychological forest: Predicting human behavior

  Plonsky, O., Erev, I., Hazan, T. & Tennenholtz, M., 2017, p. 656-662. 7 p.

  Research output: Contribution to conference › Paper › peer-review

  • Psychological Theory 100%
  • Random Decision Forest 50%
  • Best Practice 50%
  • Social Scientists 50%
  39 Scopus citations

• Redesigning stochastic environments for maximized utility

  Keren, S., Gal, A., Karpas, E., Pineda, L. & Zilberstein, S., 2017, p. 4947-4948. 2 p.

  Research output: Contribution to conference › Paper › peer-review

  • Robot 100%
  • Goal Recognition 33%
  • Heuristic Search 33%
  • Probabilistic Planning 33%
  • Process Redesign 33%
• 2014

  Distributed Information Rich Transshipments: Analytical and Simulative Approaches

  Tzimerman, A., Herer, Y. T. & Shtub, A., 2014.

  Research output: Contribution to conference › Paper › peer-review
• 2013

  Augie: A Dialogue-Augmenting Agent for Improved Health Care Communication

  Stern, R., Amir, O., Grosz, B. J., Fischer, S. H. & Sanders, L. M., 2013.

  Research output: Contribution to conference › Paper

• Avoid fixed pricing: Consume less, earn more, make clients happy

  Reshef, M. & Rosenschein, J. S., 2013, p. 239-246. 8 p.

  Research output: Contribution to conference › Paper › peer-review

  • Benefits 100%
  • Pricing 100%
  • Pricing Policy 100%
  • Incentives 50%
  • Tragedy of the Commons 50%
  2 Scopus citations

• Efficient parking allocation as online bipartite matching with posted prices

  Reshef, M., Chen, Y. & Feldman, M., 2013, p. 303-310. 8 p.

  Research output: Contribution to conference › Paper › peer-review

  • Upper Bound 100%
  • Approximates 100%
  • Incident Edge 100%
  • Rational Agent 100%
  • Approximation (Algorithm) 100%
  11 Scopus citations

• Improving department quality performance with interdepartmental integration

  Li, Q., Glover, W., Naveh, E. & Gross, M., 2013, p. 1061-1067. 7 p.

  Research output: Contribution to conference › Paper › peer-review

  • Linear Modeling 100%
  • Quantitative Data 100%

• On the Verification Complexity of Group Decision-Making Tasks

  Amir, O., Shahar, Y., Gal, Y. & Ilani, L., 2013.

  Research output: Contribution to conference › Paper

• Pay or play

  Oren, S., Schapira, M. & Tennenholtz, M., 2013, p. 488-497. 10 p.

  Research output: Contribution to conference › Paper › peer-review

  • Model Selection 100%

• The Technion at TREC 2013 Web Track: Cluster-based Document Retrieval

  Raiber, F. & Kurland, O., 2013.

  Research output: Contribution to conference › Paper › peer-review

  • Document Retrieval 100%
  • Effective Method 50%
  • retrieval method 50%
  4 Scopus citations

• Towards rational deployment of multiple heuristics in A* (extended abstract)

  Tolpin, D., Beja, T., Shimony, S. E., Felner, A. & Karpas, E., 2013, p. 220-221. 2 p.

  Research output: Contribution to conference › Paper › peer-review

  • Information Value 100%
• 2012

  Mastering multi-player games

  Azar, Y., Feige, U., Feldman, M. & Tennenholtz, M., 2012, p. 832-839. 8 p.

  Research output: Contribution to conference › Paper › peer-review

  • Rationality 100%
  • Mixed Strategy 100%
  • Main Result 100%
  • Minimax 100%
  • Performance Guarantee 100%
  1 Scopus citations

• Stability scores: Measuring coalitional stability

  Feldman, M., Reshef, M. & Tennenholtz, M., 2012, p. 160-167. 8 p.

  Research output: Contribution to conference › Paper › peer-review

  • Nash Equilibrium 100%
  • Noncooperative Game 100%
  • Congestion Game 100%
  • Main Result 100%
  • Auction 100%
  2 Scopus citations
• 2011

  Tight bounds for strategyproof classification

  Reshef, M., Almagor, S., Michaely, A. & Rosenschein, J. S., 2011, p. 297-304. 8 p.

  Research output: Contribution to conference › Paper › peer-review

  • Approximation Ratio 100%
  • Upper Bound 100%
  • Multi Agent Systems 50%
  • Artificial Intelligence 50%
  • Social Choice Theory 50%
  8 Scopus citations
• 2010

  To Max or Not to Max: Online Learning for Speeding Up Optimal Planning.

  Domshlak, C., Karpas, E. & Markovitch, S., 2010.

  Research output: Contribution to conference › Paper › peer-review
• 2008

  Critical information flow analysis in the cardiac operating room

  Parush, A., Momtahan, K., Foster-Hunt, T., Kramer, C., Holm, C. & Nathan, H., 2008.

  Research output: Contribution to conference › Paper › peer-review
• 2007

  Balancing innovation attention-to-detail and outcomeorientation to enhance innovative perofrmance

  Miron-Spektor, E., Erez, M. & Naveh, E., 2007.

  Research output: Contribution to conference › Paper › peer-review

  • Attention 100%
  • Research 33%
  5 Scopus citations

• Degradation in spatial knowledge acquisition when using automatic navigation systems

  Parush, A., Ahuvia, S. & Erev, I., 2007, p. 238-254. 17 p.

  Research output: Contribution to conference › Paper › peer-review

  • Spatial Knowledge 100%
  • Knowledge Acquisition 100%
  • Wayfinding Task 40%
  • Wayfinding 20%
  • Focused Research 20%
  111 Scopus citations

• Perceptually valid facial expression blending using expression units

  Arya, A., Parush, A. & McMullan, A., 2007, p. 82. 1 p.

  Research output: Contribution to conference › Paper › peer-review

• Project management simulation-based learning for systems engineering students

  Davidovitch, L., Shtub, A. & Parush, A., 2007, p. 17-23. 7 p.

  Research output: Contribution to conference › Paper › peer-review

  • Single User 100%
  • Engineering Student 100%
  • User Mode 100%
  • Consumers 100%
  • Multiuser 75%
  7 Scopus citations

• ProMo: A scalable and efficient framework for online data delivery

  Roitman, H., Gal, A. & Raschid, L., 2007, p. 229-230. 2 p.

  Research output: Contribution to conference › Paper › peer-review

• Semantic methods for service categorization an empirical study

  Gal, A., Segev, A. & Toch, E., 2007.

  Research output: Contribution to conference › Paper › peer-review

  • Analysis Context 100%
  • Ontology 50%
  • Service Composition 50%
  • Preprocessing Step 50%
  • Textual Description 50%
  4 Scopus citations
• 2006

  An effective inventory policy with order frequency discounts

  Ventura, J. A., Rieksts, B. Q. & Herer, Y. T., 2006.

  Research output: Contribution to conference › Paper › peer-review

  • Warehouses 100%
  • Effective Power 50%

• Impact of external representation and task on graph comprehension

  Parush, A., Ferres, L., Rasouli, M. & Lindgaard, G., 2006, p. 1932-1937. 6 p.

  Research output: Contribution to conference › Paper › peer-review
• 2005

  Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs

  Emek, Y. & Peleg, D., 2005, p. 254-263. 10 p.

  Research output: Contribution to conference › Paper › peer-review

  • Spanning Tree 100%
  • Tree Problem 50%
  • Approximation Algorithms 25%
  27 Scopus citations

• Congestion games with failures - CGFs

  Penn, M., Polukarov, M. & Tennenhpltz, M., 2005, p. 259-268. 10 p.

  Research output: Contribution to conference › Paper › peer-review

  Open Access

  • Provider Service 100%
  • Congestion Game 100%
  • Nash Equilibrium 75%
  • Strategy Nash Equilibrium 50%
  • Efficient Algorithm 25%
  18 Scopus citations

• Landmarks for navigators who are visually impaired

  Tsuji, B., Lindgaard, G. & Parush, A., 2005.

  Research output: Contribution to conference › Paper › peer-review

• Optimal Efficient Learning Equilibrium: Imperfect monitoring in symmetric games

  Brafman, R. I. & Tennenholtz, M., 2005, p. 726-731. 6 p.

  Research output: Contribution to conference › Paper › peer-review

  • Nash Equilibrium 100%
  • Polynomial Time 100%
  • Incomplete Information 100%
  • Natural Solution 100%
  • Learning Algorithm 100%
  8 Scopus citations

• Ranking systems: The PageRank axioms

  Altman, A. & Tennenholtz, M., 2005, p. 1-8. 8 p.

  Research output: Contribution to conference › Paper › peer-review

  • Coincides 100%
  • Simple Graph 100%
  • Representation Theorem 100%
  • Axiomatic Approach 100%
  • Formal Theory 100%
  129 Scopus citations