Now showing items 2117-2136 of 14421

    • Computational Complexity of a Problem in Molecular-Structure Prediction 

      Ngo, J. Thomas; Marks, Joe (1991)
      The computational task of protein-structure prediction is believed to require exponential time, but previous arguments as to its intractability have taken into account only the size of a protein’s conformational space. ...
    • The Computational Complexity of Cartographic Label Placement 

      Marks, Joe; Shieber, Stuart Merrill (1991)
      We examine the computational complexity of cartographic label placement, a problem derived from the cartographer's task of placing text labels adjacent to map features in such a way as to minimize overlaps with other labels ...
    • The Computational Complexity of Nash Equilibria in Concisely Represented Games 

      Schoenebeck, Grant R.; Vadhan, Salil P. (Association for Computing Machinery (ACM), 2012)
      Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilibrium. The traditional method of representing a ...
    • Computational Complexity of the Landscape I 

      Denef, Frederik; Douglas, Michael R. (Elsevier, 2007)
      We study the computational complexity of the physical problem of finding vacua of string theory which agree with data, such as the cosmological constant, and show that such problems are typically NP hard. In particular, ...
    • Computational Complexity of Time-Dependent Density Functional Theory 

      Whitfield, J; Yung, M-H; Tempel, David Gabriel; Boixo, S; Aspuru-Guzik, Alan (IOP Publishing, 2014)
      Time-dependent density functional theory (TDDFT) is rapidly emerging as a premier method for solving dynamical many-body problems in physics and chemistry. The mathematical foundations of TDDFT are established through the ...
    • Computational design of molecules for an all-quinone redox flow battery 

      Er, Suleyman; Suh, Changwon; Marshak, Michael; Aspuru-Guzik, Alan (Royal Society of Chemistry (RSC), 2015)
      Inspired by the electron transfer properties of quinones in biological systems, we recently showed that quinones are also very promising electroactive materials for stationary energy storage applications. Due to the ...
    • Computational Mechanism Design 

      Parkes, David C. (Institute of Mathematical Sciences, University of Singapore, 2008)
      Computational mechanism design brings together the concern in microeconomics with decision making in the context of distributed private information and self-interest and the concern in computer science with computational ...
    • Computational modeling of oscillating fins that “catch and release” targeted nanoparticles in bilayer flows 

      Liu, Ya; Bhattacharya, Amitabh; Kuksenok, Olga; He, Ximin; Aizenberg, Michael; Aizenberg, Joanna; Balazs, Anna C. (Royal Society of Chemistry (RSC), 2016)
      A number of physiological processes in living organisms involve the selective ‘‘catch and release’’ of biomolecules. Inspired by these biological processes, we use computational modeling to design synthetic systems that ...
    • The Computational Processing of Intonational Prominence: A Functional Prosody Perspective 

      Nakatani, Christine Hisayo (1997)
      Intonational prominence, or accent, is a fundamental prosodic feature that is said to contribute to discourse meaning. This thesis outlines a new, computational theory of the discourse interpretation of prominence, from a ...
    • Computational Social Science 

      Lazer, David M.; Pentland, Alex; Adamic, Lada; Aral, Sinan; Barabási, Albert-László; Brewer, Devon; Christakis, Nicholas Alexander; Contractor, Noshir; Fowler, James; Gutmann, Myron; Jebara, Tony; King, Gary; Macy, Michael; Roy, Deb; Van Alstyne, Marshall (American Association for the Advancement of Science, 2009)
      A field is emerging that leverages the capacity to collect and analyze data at a scale that may reveal patterns of individual and group behaviors.
    • Computational-Mechanism Design: A Call to Arms 

      Dash, Rajdeep K.; Jennings, Nicholas R.; Parkes, David C. (Institute of Electrical and Electronics Engineers Computer Society, 2003)
      Game theory has developed several powerful tools for analyzing decision making in systems composed of multiple autonomous actors. Given this fact, AI practitioners would like to exploit these tools when building software ...
    • Computing Complex Visual Features with Retinal Spike Times 

      Gütig, Robert; Gollisch, Tim; Sompolinsky, Haim I; Meister, Markus (Public Library of Science, 2013)
      Neurons in sensory systems can represent information not only by their firing rate, but also by the precise timing of individual spikes. For example, certain retinal ganglion cells, first identified in the salamander, ...
    • Computing Contrasts, Effect Sizes, and Counternulls on Other People's Published Data: General Procedures for Research Consumers 

      Rosenthal, Robert; Rosnow, Ralph L. (American Psychological Association, 1996)
      We describe convenient statistical procedures that will enable research consumers (e.g,, professional psychologists, graduate students, and researchers themselves) to reach beyond the published conclusions and make an ...
    • Computing cooperative solution concepts in coalitional skill games 

      Bachrach, Yoram; Parkes, David C.; Rosenschein, Jeffrey S. (Elsevier BV, 2013)
      We consider a simple model of cooperation among agents called Coalitional Skill Games (CSGs). This is a restricted form of coalitional games, where each agent has a set of skills that are required to complete various tasks. ...
    • Computing Parametric Ranking Models via Rank-Breaking 

      Soufiani, Hossein Azari; Parkes, David C.; Xia, Lirong (International Conference on Machine Learning, 2014)
      Rank breaking is a methodology introduced by Azari Soufiani et al. (2013a) for applying a Generalized Method of Moments (GMM) algorithm to the estimation of parametric ranking models. Breaking takes full rankings and breaks, ...
    • Computing Reserve Prices and Identifying the Value Distribution in Real-World Auctions with Market Dynamics 

      Walsh, William E; Parkes, David C.; Sandholm, Tuomas; Boutilier, Craig (Association for the Advancement of Artificial Intelligence, 2008)
    • Computing Sparse Representations in O(N log N) Time 

      Lin, Tsung-Han; Kung, H. T. (Signal Processing with Adaptive Sparse Structured Representations (SPARS 2013), 2013)
    • Computing the communication costs of item allocation 

      Rauenbusch, Timothy W.; Shieber, Stuart; Grosz, Barbara (Association for Computing Machinery, 2005)
      Multiagent systems require techniques for effectively allocating resources or tasks to among agents in a group. Auctions are one method for structuring communication of agents’ private values for the resource or task to a ...
    • Computing The Kullback-Leibler Divergence Between Probabilistic Automata Using Rational Kernels 

      Nelken, Rani; Shieber, Stuart Merrill (2006)
      Kullback-Leibler divergence is a natural distance measure between two probabilistic finite-state automata. Computing this distance is difficult, since it requires a summation over a countably infinite number of strings. ...
    • Computing the Steady Oceanic Circulation Using an Optimization Approach 

      Tziperman, Eli; Thacker, William C.; Bryan, Kirk (Elsevier, 1992)
      The traditional method for computing the steady oceanic circulation has been by stepping an oceanic model forward in time until transients are damped by friction. An alternative method, which has the potential for being ...