BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
game (15)
requir (9)
condit (6)
negoti (6)
softwar (5)

Stem win$ (all stems)

43 papers:

ICALPICALP-v2-2015-Klein0 #game studies #how #infinity #lookahead #question
How Much Lookahead is Needed to Win Infinite Games? (FK, MZ), pp. 452–463.
KDDKDD-2015-WuYC #predict #realtime
Predicting Winning Price in Real Time Bidding with Censored Data (WCHW, MYY, MSC), pp. 1305–1314.
LICSLICS-2015-CanavoiGLP #fixpoint #logic
Defining Winning Strategies in Fixed-Point Logic (FC, EG, SL, WP), pp. 366–377.
CSEETCSEET-2014-FranklBK14a #collaboration #education #re-engineering #social
Win-for-all in software engineering education: Balancing social dilemmas to foster collaboration (GF, SB, BK), pp. 163–167.
SIGIRSIGIR-2014-LuoZY #game studies #probability
Win-win search: dual-agent stochastic game in session search (JL, SZ, HY), pp. 587–596.
HCIDUXU-NTE-2013-PriorSEBM #challenge
HALO the Winning Entry to the DARPA UAVForge Challenge 2012 (SDP, STS, MAE, MB, WM), pp. 179–188.
RERE-2013-Beatty #requirements
Winning the hidden battle: Requirements tool selection and adoption (JB), pp. 364–365.
TLCATLCA-2013-Blot #game studies
Realizability for Peano Arithmetic with Winning Conditions in HON Games (VB), pp. 77–92.
ICSEICSE-2012-Kukreja #collaboration #elicitation #framework #named #network #requirements #social
Winbook: A social networking based framework for collaborative requirements elicitation and WinWin negotiations (NK), pp. 1610–1612.
CSLCSL-2012-GradelL #game studies
Banach-Mazur Games with Simple Winning Strategies (EG, SL), pp. 305–319.
LICSLICS-2012-ChatterjeeD #game studies #how #probability
Partial-Observation Stochastic Games: How to Win When Belief Fails (KC, LD), pp. 175–184.
LICSLICS-2012-ClairambaultGW #concurrent #game studies
The Winning Ways of Concurrent Games (PC, JG, GW), pp. 235–244.
SASSAS-2011-NoriR #machine learning #program analysis
Program Analysis and Machine Learning: A Win-Win Deal (AVN, SKR), pp. 2–3.
CIAACIAA-2009-Zimmermann #game studies
Time-Optimal Winning Strategies for Poset Games (MZ0), pp. 217–226.
LICSLICS-2009-HansenKM #concurrent #game studies #reachability
Winning Concurrent Reachability Games Requires Doubly-Exponential Patience (KAH, MK, PBM), pp. 332–341.
CSEETCSEET-2008-Honig #education #exclamation #generative #process #quality #re-engineering
Teaching Successful “Real-World” Software Engineering to the “Net” Generation: Process and Quality Win! (WLH), pp. 25–32.
LICSLICS-2008-CarayolHMOS #automaton #game studies #higher-order
Winning Regions of Higher-Order Pushdown Games (AC, MH, AM, CHLO, OS), pp. 193–204.
CSLCSL-2007-Kopczynski
ω-Regular Half-Positional Winning Conditions (EK), pp. 41–53.
ASEASE-2006-Thrun #challenge
Winning the DARPA Grand Challenge: A Robot Race through the Mojave Desert (ST), p. 11.
DACDAC-2006-SingerMBHK #question #what
The IC nanometer race — what will it take to win? (GS, PM, DB, FCH, HKK), pp. 77–78.
CSEETCSEET-2006-GrunbacherSBIKP #approach #education #re-engineering #student
Making Every Student a Winner: The WinWin Approach in Software Engineering Education (PG, NS, ROB, HPI, HK, DP), pp. 201–208.
TACASTACAS-2006-ChatterjeeH #game studies
Finitary Winning in ω-Regular Games (KC, TAH), pp. 257–271.
FSEFSE-2006-DamasLL #state machine #synthesis
Scenarios, goals, and state machines: a win-win partnership for model synthesis (CD, BL, AvL), pp. 197–207.
LICSLICS-2006-BrazdilBFK #game studies #probability
Stochastic Games with Branching-Time Winning Objectives (TB, VB, VF, AK), pp. 349–358.
ICALPICALP-2004-Serre #complexity #game studies
Games with Winning Conditions of High Borel Complexity (OS), pp. 1150–1162.
SIGMODSIGMOD-2003-ZuzartePMCLW #using
WinMagic : Subquery Elimination Using Window Aggregation (CZ, HP, WM, QC, LL, KW), pp. 652–656.
CSLCSL-2003-Walukiewicz #synthesis #tutorial
Winning Strategies and Synthesis of Controllers (Tutorial) (IW), p. 574.
SEKESEKE-2002-RuheEP #requirements
Quantitative WinWin: a new method for decision support in requirements negotiation (GR, AE, DP), pp. 159–166.
CSLCSL-2002-CachatDT #automaton #game studies
Solving Pushdown Games with a Σ₃ Winning Condition (TC, JD, WT), pp. 322–336.
ASEASE-2001-FahmyHC #algebra #architecture
Wins and Losses of Algebraic Transformations of Software Architectures (HF, RCH, JRC), pp. 51–62.
VISSOFTSVIS-2001-BaskenN #algorithm #geometry #interactive #named #visualisation
GeoWin — A Generic Tool for Interactive Visualization of Geometric Algorithms (MB, SN), pp. 88–100.
FSEESEC-FSE-2001-GrunbacherB #named #requirements
EasyWinWin: a groupware-supported methodology for requirements negotiation (PG, BWB), pp. 320–321.
ICSEICSE-2001-BoehmGB #named #requirements
EasyWinWin: A Groupware-Supported Nethodology for Requirements Negotiation (BWB, PG, ROB), pp. 720–721.
ICSEICSE-2001-InBRD #case study #quality #requirements
Applying WinWin to Quality Requirements: A Case Study (HI, BWB, TLR, MD), pp. 555–564.
FASEFASE-2000-LuthW #development #tool support
More About TAS and IsaWin — Tools for Formal Program Development (CL, BW), pp. 367–370.
FASEFASE-1999-LuthTKK #development #proving #theorem proving #tool support
TAS and IsaWin: Tools for Transformational Program Development and Theorem Proving (CL, HT, K, BKB), pp. 239–243.
ICSEICSE-1999-HorowitzLL #named #requirements
WinWin: A System for Negotiating Requirements (EH, JHL, JSL), pp. 646–649.
ESECESEC-FSE-1997-BoehmEKM #multi
Developing Multimedia Applications with the WinWin Spiral Model (BWB, AE, JK, RJM), pp. 20–39.
LICSLICS-1997-DziembowskiJW #game studies #how #infinity #memory management #question
How Much Memory is Needed to Win Infinite Games? (SD, MJ, IW), pp. 99–110.
TACASTACAS-1996-BuhrkeLV #infinity
Strategy Construction in Infinite Ganes with Streett and Rabin Chain Winning Conditions (NB, HL, JV), pp. 207–224.
ASEKBSE-1995-Bose #collaboration #framework #maintenance
A Model for Decision Maintenance in the WinWin Collaboration Framework (PKB), pp. 105–113.
CAVCAV-1995-Lescow #finite #game studies #on the #source code
On Polynomial-Size Programs Winning Finite-State Games (HL), pp. 239–252.
REICRE-1994-BoehmBHL #requirements
Software requirements as negotiated win conditions (BWB, PKB, EH, MJL), pp. 74–83.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.