Result 1 to 20 of 1124 total
Understanding I/O performance using I/O skeletal applications. (English)
Kaklamanis, Christos (ed.) et al., Euro-Par 2012 parallel processing. 18th international conference, Euro-Par 2012, Rhodes Island, Greece, August 27‒31, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32819-0/pbk). Lecture Notes in Computer Science 7484, 77-88 (2012).
1
Excluding induced subdivisions of the bull and related graphs. (English)
J. Graph Theory 71, No. 1, 49-68 (2012).
2
io-port 06070764 Mador-Haim, Sela;
Maranget, Luc;
Sarkar, Susmit;
Memarian, Kayvan;
Alglave, Jade;
Owens, Scott;
Alur, Rajeev;
Martin, Milo M.K.;
Sewell, Peter;
Williams, Derek
An axiomatic memory model for POWER multiprocessors. (English)
Madhusudan, P. (ed.) et al., Computer aided verification. 24th international conference, CAV 2012, Berkeley, CA, USA, July 7‒13, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31423-0/pbk). Lecture Notes in Computer Science 7358, 495-512 (2012).
3
Spanning trees and the complexity of flood-filling games. (English)
Kranakis, Evangelos (ed.) et al., Fun with algorithms. 6th international conference, FUN 2012, Venice, Italy, June 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30346-3/pbk). Lecture Notes in Computer Science 7288, 282-292 (2012).
4
Abstract model repair. (English)
Goodloe, Alwyn E. (ed.) et al., NASA formal methods. 4th international symposium, NFM 2012, Norfolk, VA, USA, April 3‒5, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28890-6/pbk). Lecture Notes in Computer Science 7226, 341-355 (2012).
5
Simulating the kinematics of completely faceted surfaces. (English)
J. Comput. Phys. 231, No. 14, 4560-4577 (2012).
6
On Ryser’s conjecture. (English)
Electron. J. Comb. 19, No. 1, Research Paper P23, 10 p., electronic only (2012).
7
The complexity of flood-filling games on graphs. (English)
Discrete Appl. Math. 160, No. 7-8, 959-969 (2012).
8
Monochromatic cycles in 2-coloured graphs. (English)
Comb. Probab. Comput. 21, No. 1-2, 57-87 (2012).
9
Efficient and good Delaunay meshes from random points. (English)
Comput.-Aided Des. 43, No. 11, 1506-1515 (2011).
10
A bound for the cops and robbers problem. (English)
SIAM J. Discrete Math. 25, No. 3, 1438-1442 (2011).
11
Minesweeper may not be NP-complete but is hard nonetheless. (English)
Math. Intell. 33, No. 4, 5-17 (2011).
12
A case study of the design and evaluation of a persuasive healthy lifestyle assistance technology: challenges and design guidelines. (English)
Stephanidis, Constantine (ed.), Universal access in human-computer interaction. Applications and services. 6th international conference, UAHCI 2011, held as Part of HCI international 2011, Orlando, FL, USA, July 9‒14, 2011. Proceedings, Part IV. Berlin: Springer (ISBN 978-3-642-21656-5/pbk). Lecture Notes in Computer Science 6768, 464-471 (2011).
13
Predicting human scores of essay quality using computational indices of linguistic and textual features. (English)
Biswas, Gautam (ed.) et al., Artificial intelligence in education. 15th international conference, AIED 2011, Auckland, New Zealand, June 28 ‒ July 2011. Berlin: Springer (ISBN 978-3-642-21868-2/pbk). Lecture Notes in Computer Science 6738. Lecture Notes in Artificial Intelligence, 438-440 (2011).
14
Likelihood-free MCMC. (English)
Brooks, Steve (ed.) et al., Handbook of Markov chain Monte Carlo. Boca Raton, FL: CRC Press (ISBN 978-1-4200-7941-8/hbk; 978-1-4200-7942-5/ebook). Chapman \& Hall/CRC Handbooks of Modern Statistical Methods, 313-335 (2011).
15
Reversible jump MCMC. (English)
Brooks, Steve (ed.) et al., Handbook of Markov chain Monte Carlo. Boca Raton, FL: CRC Press (ISBN 978-1-4200-7941-8/hbk; 978-1-4200-7942-5/ebook). Chapman \& Hall/CRC Handbooks of Modern Statistical Methods, 67-91 (2011).
16
Cover-decomposition and polychromatic numbers. (English)
Demetrescu, Camil (ed.) et al., Algorithms ‒ ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 799-810 (2011).
17
From cardiac cells to genetic regulatory networks. (English)
Gopalakrishnan, Ganesh (ed.) et al., Computer aided verification. 23rd international conference, CAV 2011, Snowbird, UT, USA, July 14‒20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22109-5/pbk). Lecture Notes in Computer Science 6806, 396-411 (2011).
18
Exploiting reusable organizations to reduce complexity in multiagent system design. (English)
Gleizes, Marie-Pierre (ed.) et al., Agent-oriented software engineering X. 10th international workshop, AOSE 2009, Budapest, Hungary, May 11‒12, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19207-4/pbk). Lecture Notes in Computer Science 6038, 3-17 (2011).
19
Model repair for probabilistic systems. (English)
Abdulla, Parosh Aziz (ed.) et al., Tools and algorithms for the construction and analysis of systems. 17th international conference, TACAS 2011, held as part of the joint European conferences on theory and practice of software, ETAPS 2011, Saarbrücken, Germany, March 26 ‒ April 3, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19834-2/pbk). Lecture Notes in Computer Science 6605, 326-340 (2011).
20
Result 1 to 20 of 1124 total
Start
Contact
Print
General Help
