Search results for "k-ECSS"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
117	Sven Oliver Krumke, Peter Merz, Tim Nonner, Katharina Rupp	Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs.	OPODIS	2007	DBLP DOI BibTeX RDF
67	Hannes Werthner, Frank van Harmelen (eds.)	Informatics in the Future - Proceedings of the 11th European Computer Science Summit, ECSS 2015, Vienna, Austria, October 2015	ECSS	2017	DBLP DOI BibTeX RDF
67	Jeroen van den Hoven	Ethics for the Digital Age: Where Are the Moral Specs?	ECSS	2015	DBLP DOI BibTeX RDF
67	Britta Schinzel	Women in Computing and the Contingency of Informatics Cultures.	ECSS	2015	DBLP DOI BibTeX RDF
67	Reinhard Posch	Digital Sovereignty and IT-Security for a Prosperous Society.	ECSS	2015	DBLP DOI BibTeX RDF
67	Bertrand Meyer 0001	Rational Ethics.	ECSS	2015	DBLP DOI BibTeX RDF
67	Stefano Ceri	On the Big Impact of "Big Computer Science".	ECSS	2015	DBLP DOI BibTeX RDF
67	Maarja Kruusmaa	On Informatics, Diamonds and T.	ECSS	2015	DBLP DOI BibTeX RDF
67	Britta Schinzel	Ada: Poet of Computing.	ECSS	2015	DBLP DOI BibTeX RDF
67	Matti Tedre, Peter J. Denning	Shifting Identities in Computing: From a Useful Tool to a New Method and Theory of Science.	ECSS	2015	DBLP DOI BibTeX RDF
67	Dunja Mladenic, Marko Grobelnik	Leadership and Balance in Research.	ECSS	2015	DBLP DOI BibTeX RDF
47	Juan Chen 0001, Yong Dong, Xuejun Yang, Panfeng Wang	Energy-Constrained OpenMP Static Loop Scheduling.	HPCC	2008	DBLP DOI BibTeX RDF
47	Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov	Power Optimization for Connectivity Problems.	IPCO	2005	DBLP DOI BibTeX RDF
47	Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson	Approximating the smallest k-edge connected spanning subgraph by LP-rounding.	SODA	2005	DBLP BibTeX RDF
47	Harold N. Gabow	Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph.	SODA	2003	DBLP BibTeX RDF
36	Joseph Cheriyan, Ramakrishna Thurimella	Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract).	FOCS	1996	DBLP DOI BibTeX RDF	minimum-size, k-connected spanning subgraphs, k-NCSS, k-ECSS, graph theory, heuristic, matching, undirected graphs
33	D. Ellis Hershkowitz, Nathan Klein, Rico Zenklusen	Ghost Value Augmentation for k-ECSS and k-ECSM.	CoRR	2023	DBLP DOI BibTeX RDF
33	Elaheh Maleki, Alberto Gonzalez Fernandez, Jamie Whitehouse, Anh-Toan Bui-Long	How the current ECSS standards are compatible with digitalization in space systems engineering.	SoSE	2023	DBLP DOI BibTeX RDF
33	Shiqiang Wu, Ying Huang, Hu Guan, Shuwu Zhang, Jie Liu 0028	ECSS: High-Embedding-Capacity Audio Watermarking with Diversity Reception.	Entropy	2022	DBLP DOI BibTeX RDF
33	Vaisakh Suresh, Chetna Singhal 0001	ECSS: Efficient Cooperative Spectrum Sensing in CBRS based Cognitive Radio System.	VTC Spring	2021	DBLP DOI BibTeX RDF
33	Regina Moraes, Tânia Basso, Eliane Martins	V-Model Adaptation for Space Systems in Light of the ECSS Standard.	LADC	2021	DBLP DOI BibTeX RDF
33	Emily Z. Wang, Yi-Gui Wang	Computational Study in a PUI using XSEDE Resources and ECSS Support.	PEARC	2020	DBLP DOI BibTeX RDF
33	Carlos Rosales, Robert T. McLay	ECSS Experience: Particle Tracing Reinvented.	XSEDE	2014	DBLP DOI BibTeX RDF
33	Melissa Romanus, Pradeep Kumar Mantha, Matt McKenzie, Thomas C. Bishop, Emilio Gallicchio, André Merzky, Yaakoub El Khamra, Shantenu Jha	The anatomy of successful ECSS projects: lessons of supporting high-throughput high-performance ensembles on XSEDE.	XSEDE	2012	DBLP DOI BibTeX RDF
33	Robert S. Feingold, Yen W. Chao	Statistical instrumentation of ECSS models.	ANSS	1974	DBLP BibTeX RDF
33	Donald W. Kosy	An interim empirical evaluation of ECSS for computer system simulation development.	ANSS	1973	DBLP BibTeX RDF
23	Albrecht Schmidt 0001	Engineering interactive ubiquitous computing systems.	EICS	2011	DBLP DOI BibTeX RDF
23	Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov	Power optimization for connectivity problems.	Math. Program.	2007	DBLP DOI BibTeX RDF
23	André Berger, Michelangelo Grigni	Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs.	ICALP	2007	DBLP DOI BibTeX RDF