نتایج جستجو برای: cc

تعداد نتایج: 31404  

2017
Dan Ventura

Building a computationally creative system is a challenging undertaking. While such systems are beginning to proliferate, and a good number of them have been reasonably well-documented, it may seem, especially to newcomers to the field, that each system is a bespoke design that bears little chance of revealing any general knowledge about CC system building. This paper seeks to dispel this conce...

1995
Laurent Perron

In this article, we tackle the problem of compiling cc(X) languages 9, 13] where X is an admissible constraint domain. The diiculty of this task consists in one) representing and optimising diierent domains X and two) providing an parallel and extensible execution model. A simple way to meet these demands is to provide a minimal parallel (and distributable) kernel language expressive enough to ...

Journal: :TURKISH JOURNAL OF MATHEMATICS 2017

2006
B. Aubert R. Barate M. Bona D. Boutigny F. Couderc Y. Karyotakis J. P. Lees V. Poireau V. Tisserand A. Zghiche E. Grauges A. Palano J. C. Chen N. D. Qi G. Rong P. Wang Y. S. Zhu G. Eigen I. Ofte B. Stugu G. S. Abrams M. Battaglia D. N. Brown J. Button-Shafer R. N. Cahn E. Charles M. S. Gill Y. Groysman R. G. Jacobsen J. A. Kadyk L. T. Kerth Yu. G. Kolomensky G. Kukartsev G. Lynch L. M. Mir P. J. Oddone T. J. Orimoto M. Pripstein N. A. Roe M. T. Ronan W. A. Wenzel P. del Amo Sanchez M. Barrett K. E. Ford T. J. Harrison A. J. Hart C. M. Hawkes S. E. Morgan A. T. Watson K. Goetzen T. Held H. Koch B. Lewandowski M. Pelizaeus K. Peters T. Schroeder M. Steinke J. T. Boyd J. P. Burke W. N. Cottingham D. Walker T. Cuhadar-Donszelmann B. G. Fulsom C. Hearty N. S. Knecht T. S. Mattison J. A. McKenna A. Khan P. Kyberd M. Saleem D. J. Sherwood L. Teodorescu V. E. Blinov A. D. Bukin V. P. Druzhinin V. B. Golubev A. P. Onuchin S. I. Serednyakov Yu. I. Skovpen E. P. Solodov K. Yu Todyshev D. S. Best M. Bondioli M. Bruinsma M. Chao S. Curry I. Eschrich D. Kirkby A. J. Lankford P. Lund M. Mandelkern R. K. Mommsen W. Roethel D. P. Stoker S. Abachi C. Buchanan S. D. Foulkes J. W. Gary O. Long B. C. Shen K. Wang L. Zhang H. K. Hadavand E. J. Hill H. P. Paar S. Rahatlou V. Sharma J. W. Berryhill C. Campagnari A. Cunha B. Dahmes T. M. Hong D. Kovalskyi J. D. Richman T. W. Beck A. M. Eisner C. J. Flacco C. A. Heusch J. Kroseberg W. S. Lockman G. Nesom T. Schalk B. A. Schumm A. Seiden P. Spradlin D. C. Williams M. G. Wilson J. Albert E. Chen A. Dvoretskii D. G. Hitlin I. Narsky T. Piatenko F. C. Porter A. Ryd A. Samuel R. Andreassen G. Mancinelli B. T. Meadows M. D. Sokoloff F. Blanc P. C. Bloom S. Chen W. T. Ford J. F. Hirschauer A. Kreisel U. Nauenberg A. Olivas W. O. Ruddick J. G. Smith K. A. Ulmer S. R. Wagner J. Zhang A. Chen E. A. Eckhart A. Soffer W. H. Toki R. J. Wilson F. Winklmeier Q. Zeng D. D. Altenburg E. Feltresi A. Hauke H. Jasper A. Petzold B. Spaan T. Brandt V. Klose H. M. Lacker W. F. Mader R. Nogowski J. Schubert K. R. Schubert R. Schwierz J. E. Sundermann A. Volk D. Bernard G. R. Bonneaud P. Grenier E. Latour M. Verderi D. J. Bard P. J. Clark W. Gradl F. Muheim S. Playfer A. I. Robertson Y. Xie M. Andreotti D. Bettoni C. Bozzi R. Calabrese G. Cibinetto E. Luppi M. Negrini A. Petrella L. Piemontese E. Prencipe F. Anulli R. Baldini-Ferroli

B. Aubert, R. Barate, M. Bona, D. Boutigny, F. Couderc, Y. Karyotakis, J. P. Lees, V. Poireau, V. Tisserand, A. Zghiche, E. Grauges, A. Palano, J. C. Chen, N. D. Qi, G. Rong, P. Wang, Y. S. Zhu, G. Eigen, I. Ofte, B. Stugu, G. S. Abrams, M. Battaglia, D. N. Brown, J. Button-Shafer, R. N. Cahn, E. Charles, M. S. Gill, Y. Groysman, R. G. Jacobsen, J. A. Kadyk, L. T. Kerth, Yu. G. Kolomensky, G. K...

1998
Cristina G. Fernandes

The Multicut problem can be deened as: given a graph G and a collection of pairs of distinct vertices (si; ti) of G, nd a minimum set of edges of G whose removal disconnects each si from the corresponding ti. The fractional Multicut problem is the dual of the well-known Multicommodity Flow problem. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being...

2006
A. Johnston O. Levin

This specification defines conferencing call control features for the Session Initiation Protocol (SIP). This document builds on the Conferencing Requirements and Framework documents to define how a tightly coupled SIP conference works. The approach is explored from the perspective of different user agent (UA) types: conferenceunaware, conference-aware, and focus UAs. The use of Uniform Resourc...

Journal: :Sba: Controle & Automação Sociedade Brasileira de Automatica 2010

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید