4,607 Hits in 4.5 sec

How we designed winning algorithms for abstract argumentation and which insight we attained

Federico Cerutti, Massimiliano Giacomin, Mauro Vallati
2019 Artificial Intelligence  
The journal reports results achieved in addition to proposals for new ways of looking at AI problems, both of which must include demonstrations of value and effectiveness.  ...  Papers describing applications of AI are also welcome, but the focus should be on how new and novel AI methods advance performance in application areas, rather than a presentation of yet another application  ...  Such papers should motivate and describe the competition design as well as report and interpret competition results, with an emphasis on insights that are of value beyond the competition (series) itself  ... 
doi:10.1016/j.artint.2019.08.001 fatcat:rnlaav5aybhwjhtjq4napc3m3i

The Overlooked Don't-Care Notion in Algorithmic Problem Solving

2009 Informatics in Education. An International Journal  
In this paper, we illuminate and elaborate on this notion with six algorithmic illustrations, and describe our experience with novice difficulties with respect to this notion.  ...  It is the core of non-determinism; it is essential in various computational models; it is central in distributed and concurrent algorithms; and it also is relevant in sequential, deterministic algorithms  ...  The player who makes the last move, which yields less than K piles, wins. Devise a strategy for winning the game.  ... 
doaj:c419318617754d55904ef2c17ae695ac fatcat:4qh6lvpbavfwvdjia3a2cn343a

Behaviorism is Not Enough

Michael D. Ekstrand, Martijn C. Willemsen
2016 Proceedings of the 10th ACM Conference on Recommender Systems - RecSys '16  
In this paper, we argue that listening to what users say -about the items and recommendations they like, the control they wish to exert on the output, and the ways in which they perceive the system -and  ...  We hope that our work will spur useful discussion and many new ideas for recommenders that empower their users.  ...  ACKNOWLEDGEMENTS We thank Jennifer Ekstrand for her valuable insights and feedback on draft versions of this paper.  ... 
doi:10.1145/2959100.2959179 dblp:conf/recsys/EkstrandW16 fatcat:6vxx23nfm5abbpi5lsewygiali

Controller Synthesis for Mode-Target Games

Ayca Balkan, Moshe Vardi, Paulo Tabuada
2015 IFAC-PapersOnLine  
The key insight of synthesis is that design should be constrained so that resulting systems are easily verified and, ideally, synthesis algorithms should directly provide a proof of correctness.  ...  The resulting algorithm has the same worst case time complexity and we illustrate through experimental results the extent to which it improves upon the algorithms obtained via GR(1) embeddings.  ...  We use the short hand notation ϕ ∧ ψ, for ¬(¬ϕ ∨ ¬ψ), and True for ¬ϕ ∨ ϕ. We further abbreviate True U ϕ as ♦ϕ which means that ϕ eventually holds and ¬♦¬ϕ by ϕ, which says that ϕ always holds.  ... 
doi:10.1016/j.ifacol.2015.11.198 fatcat:cuw6v4u6t5e7ha4z757cb73o4q

Genetic and Evolutionary Algorithms and Programming: General Introduction and Application to Game Playing [chapter]

Michael Orlov, Moshe Sipper, Ami Hauptman
2009 Encyclopedia of Complexity and Systems Science  
And so we turned to evolution to find an optimal way to overcome this problem: How to add more search at the expense of less knowledgeable (and thus less time-consuming) node evaluators, while attaining  ...  player's code layout (HaikuBot division) Genetic and Evolutionary Algorithms and Programming: General Introduction and Appl. to Game Playing, Table 7 7 Percent of wins, advantages, and draws for best  ...  The common techniques include mining association rules, mining sequential patterns, clustering, and classification, among others.  ... 
doi:10.1007/978-0-387-30440-3_243 fatcat:nhlk57kcu5bq3ky4jw2uwwi3hm

Team Persuasion [chapter]

David Kohan Marzagão, Josh Murphy, Anthony P. Young, Marcelo Matheus Gauy, Michael Luck, Peter McBurney, Elizabeth Black
2018 Lecture Notes in Computer Science  
The audience can see the induced sub-framework of all asserted arguments in a given round, and thus the audience can determine whether the topic argument is acceptable, and therefore which team is winning  ...  We derive an analytical expression for the probability of either team winning given the initially asserted arguments, where in each round, each agent probabilistically decides whether to assert or withdraw  ...  For a ∈ A let λ a be the decision algorithm of agent a, that takes input β and φ and outputs s(a) ∈ X, for s ∈ S. We define Λ as the set of algorithms for all a ∈ A.  ... 
doi:10.1007/978-3-319-75553-3_12 fatcat:kg6yo4vdgjavtiaxgi3xeargom

A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament

Peter Bro Miltersen, Troels Bjerre Sørensen
2007 Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems - AAMAS '07  
However, combining an algorithm due to Koller, Megiddo and von Stengel with concepts of Everett and suggestions of Sklansky, we compute an optimal jam/fold strategy, i.e. a strategy that would be optimal  ...  We analyze a heads-up no-limit Texas Hold'em poker tournament with a fixed small blind of 300 chips, a fixed big blind of 600 chips and a total amount of 8000 chips on the table (until recently, these  ...  one of the players (we may not know which a priori) an advantage not considered in the argument.  ... 
doi:10.1145/1329125.1329357 dblp:conf/atal/MiltersenS07 fatcat:cwz4v6vl3zhdre44k66gc6awqa

Incentives and Problem Uncertainty in Innovation Contests: An Empirical Analysis

Kevin J. Boudreau, Nicola Lacetera, Karim R. Lakhani
2011 Management science  
C ontests are a historically important and increasingly popular mechanism for encouraging innovation. A central concern in designing innovation contests is how many competitors to admit.  ...  We explore the implications of our findings for the theory and practice of innovation contests.  ...  Acknowledgments The authors thank TopCoder executives, Jack Hughes, Rob Hughes, Mike Lydon, Lars Backstrom, and Ira Heffan for their invaluable input and assistance.  ... 
doi:10.1287/mnsc.1110.1322 fatcat:nwm56izbvvgjbgv4hwo2khgygq

Relevance to Practice and Auction Theory: A Memorial Essay for Michael Rothkopf

Ronald M. Harstad, Aleksandar Saša Pekeč
2008 Interfaces  
Most auction models are more abstract than necessary. They depend on assumptions that are highly unlikely to occur in practical situations, which are often less formal and rigid.  ...  Nonetheless, we discuss several significant steps toward offering more practical advice.  ...  Rothkopf (2003, 2006 ) discuss how to approach combinatorialauction design and how to resolve potential problems by careful design choices without having to apply heavy computational firepower.  ... 
doi:10.1287/inte.1080.0396 fatcat:dbpxpj4kqrd47mf6gjdlbkv22e

Philosophy of teaching: When win-argument pedagogy is a loss for the composition classroom

2015 Argument : Biannual Philosophical Journal  
we wish to avoid — the eristic, in which the goal is not truth seeking, but successfully disputing another's argument.  ...  Although these factors might contribute to faulty written output in some cases, the prevailing hindrance is our very pedagogy, a system in which students are rewarded for composing the very type of argument  ...  How we teach arguments, how we define them in the classroom, how we manage our grading criteria, and what features we decide will characterise the well -written argument are key points to consider as we  ... 
doaj:ee8c456813104cd99890a1cda9ea2675 fatcat:hlmd65zp5zcsbip2vdx6owovba

The progress of science from a computational point of view: the drive towards ever higher solvability

Witold Marciszewski
2019 Foundations of Computing and Decision Sciences  
Conclusion: in the progress of science an essential role is played by the feedback between intellectual intuitions (intuitive solvability) and algorithmic procedures (effective solvability).  ...  However, it needs creative insights to obtain axioms and rules of a formal system as a prerequisite for new algorithms to meet new challenges.  ...  Braces {} are used in set theory to designate a class (i.e., set); for instance {1, 2, 3} is the class of those numbers which are listed inside.  ... 
doi:10.2478/fcds-2019-0002 fatcat:dw3k34fia5bqffat4fhcuutqqq

Exaflop/s: The why and the how

David E. Keyes
2011 Comptes rendus. Mecanique  
Drawing on vendor projections and experiences with scientific codes on contemporary platforms, we outline the challenges and propose roles and essential adaptations for mathematical modelers in one of  ...  The best paths to the exascale summit are debatable, but all are narrow and treacherous, constrained by fundamental laws of physics, capital cost, operating cost, power requirements, programmability, and  ...  An important question is whether today's best algorithms are efficiently hosted on the exascale hardware the scientific community is likely to receive, and how much co-design of algorithms and architecture  ... 
doi:10.1016/j.crme.2010.11.002 fatcat:go2cav7yi5elxigo6va65ccswq

Philosophy of Computer Science

William J. Rapaport
2005 Teaching Philosophy  
Along the way, we will look at how philosophers reason and evaluate logical arguments, and there will be some suggested writing assignments designed to help focus your thinking about these issues. 1  ...  And as soon as one's purpose is the attainment of the maximum of possible insight into the world as a whole, the metaphysical puzzles become the most urgent ones of all.  ...  And how would this be proved?  ... 
doi:10.5840/teachphil200528443 fatcat:tqbgz4unajgpladtqmui7feae4

Building a Post-work Utopia: Technological Unemployment, Life Extension, and the Future of Human Flourishing [chapter]

John Danaher
2017 Surviving the Machine Age  
This is triggering a social crisis in which shrinking youth populations are required to pay for the care and retirements of an aging majority.  ...  This does not mean that we should not pursue lifespan extension, but it does mean that the argument in its favor needs to rest on other grounds.  ...  A well-designed game allows for some complexity in the relationship between means and ends.  ... 
doi:10.1007/978-3-319-51165-8_5 fatcat:fpz53vhz2fgq7atznlip5jwspa

Visions in Theoretical Computer Science: A Report on the TCS Visioning Workshop 2020 [article]

Shuchi Chawla, Jelani Nelson, Chris Umans, David Woodruff
2021 arXiv   pre-print
a professional graphic designer.  ...  And how efficiently? Every ten years or so the TCS community attends visioning workshops to discuss the challenges and recent accomplishments in the TCS field.  ...  This leads to natural questions, such as how to design even faster algorithms for quantum computers and how to verify their computations.  ... 
arXiv:2107.02846v1 fatcat:rqtyk4obbjfwpeiovsymacxnga
« Previous Showing results 1 — 15 out of 4,607 results