Search results for "escape"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
477	Yang Liu, Li Li	Money Policy in Dynamic Stochastic General Equilibrium Models.	CAR	2009	DBLP DOI BibTeX RDF	Money Policy, Dynamic Stochastic General Equilibrium Model, MIU Citation: Yang Liu, Li Li, Money Policy in Dynamic Stochastic General Equilibrium Models, pp.406-409, 2009 International Asia Conference on Informatics in Control, Automation and Robotics, 2009 Peer Review Notice, Give Us Feedback Usage of this product signifies your acceptance of the Terms of Use. var addtoMethod=1, var AddURL = escape(http://doi.ieeecomputersociety.org/), var AddTitle = escape(Money Policy in Dynamic Stochastic General Equilibrium Models), var savedIndex = 0, function openLinks(pPackageTitle,title,pProductTitle, index) { var productId = escape(1564), var pubYear = escape(2009), var volume = escape(0), var issueNo = escape(0), var packageTitle = escape(2009 International Asia Conference on Informatics in Control, Automation and Robotics), var productTitle = escape(Informatics in Control, Automation and Robotics, International Asia Conference on), var acronymTemp = escape(CAR), var bcPageName = escape(C), var pubType = escape(p), var linkToYear=escape(/plugins/dl/years/1564), var linkToIssue=escape(/plugins/dl/years/1564?year=2009&vol=0), var linkToTOC=escape(/plugins/dl/toc/6544), var linkToAbstract = escape(/plugins/dl/doi/10.1109/CAR.2009.103), var journalPage = escape(cc), var abbrevTitle = escape(car), var yearTitle = escape(2009), var issueTitle = 'Issue No. ' + issueNo + ' - ' + packageTitle, var absTitle = escape(Money Policy in Dynamic Stochastic General Equilibrium Models), if(pubType == m) { var breadcrumbs = new BreadCrumbs('/portal/web/csdl/magazines/' + journalPage), } else if (pubType == t) { var breadcrumbs = new BreadCrumbs('/portal/web/csdl/transactions/' + journalPage), } else if (pubType == l) { var breadcrumbs = new BreadCrumbs('/portal/web/csdl/letters/' + journalPage), } else { var breadcrumbs = new BreadCrumbs('/portal/web/csdl/proceedings/' + journalPage), } if (pubYear == 5555) { if(issueNo == 1) { if(abbrevTitle != cal) { breadcrumbs.add('PrePrints', linkToTOC, 1), } } else if(issueNo == 2) { breadcrumbs.add('RapidPosts', linkToTOC, 1), } else { }, } else if(pubType == p) { breadcrumbs.add(pProductTitle, linkToYear, 1), breadcrumbs.add(yearTitle, linkToYear + '?year=' + pubYear + '&vol=' + volume, 2), breadcrumbs.add(pPackageTitle,linkToTOC, 3), breadcrumbs.add(title , linkToAbstract, 4), } else { breadcrumbs.add(yearTitle, linkToYear + '?year=' + pubYear + '&vol=' + volume, 1), breadcrumbs.add(issueTitle,linkToTOC, 2), breadcrumbs.add('Abstract - '+ title , linkToAbstract, 3), } if(pubType == m) { //document.location = /portal/web/csdl/magazines/ + journalPage, var urlLocation = location.protocol + '//' + location.host + '/portal/web/csdl/magazines/' + journalPage, } else if (pubType == t) { var urlLocation = location.protocol + '//' + location.host + '/portal/web/csdl/transactions/' + journalPage, //document.location = /portal/web/csdl/transactions/ + journalPage, } else if (pubType == l) { var urlLocation = location.protocol + '//' + location.host + '/portal/web/csdl/letters/' + journalPage, //document.location = /portal/web/csdl/letters/ + journalPage, } else { var urlLocation = location.protocol + '//' + location.host + '/portal/web/csdl/proceedings/' + journalPage, //document.location = /portal/web/csdl/proceedings/ + journalPage, } } Open Download Liferay.Portlet.onLoad({ canEditTitle: false, columnPos: 1, isStatic: 'end', namespacedId: 'p_p_id_digitallibraryabstract_WAR_plugins_INSTANCE_uxob_', portletId: 'digitallibraryabstract_WAR_plugins_INSTANCE_uxob' }), //, Math.floor(Math.random()*1E16), document.write('')&rrc=1" title="Search for publications containing 'tile=3,sz=300x250,336x280,ord=' + ord + '?></script>')'">tile=3,sz=300x250,336x280,ord=' + ord + '?>'), //]]> Liferay.Portlet.onLoad({ canEditTitle: false, columnPos: 2, isStatic: 'end', namespacedId: 'p_p_id_56_INSTANCE_T3mf_', portletId: '56_INSTANCE_T3mf' }), car, setTimeout(window.location.href = ' + urlLocation + ', 0), setTimeout(window.location.href = ' + urlLocation + ', 0), setTimeout(window.location.href = ' + urlLocation + ', 0), setTimeout(window.location.href = ' + urlLocation + ', 0), breadcrumbs.setLastIndex(index-1), breadcrumbs.setLastIndex(index-1), breadcrumbs.setLastIndex(index-1), breadcrumbs.setLastIndex(index-1), //breadcrumbs.select(index), //breadcrumbs.select(index), //breadcrumbs.select(index), //breadcrumbs.select(index), breadcrumbs.add('Abstract - '+ title , linkToAbstract, 2), breadcrumbs.add('Abstract - '+ title , linkToAbstract, 2)
477	Feifei Feng, Yongjun Wu, Chu Zhang, Yiming Wu	Application of Artificial Neural Network Model Established by Tumor Markers and Bronchofibroscopic Data in Auxiliary Diagnosis of Lung Cancer.	ICNC (2)	2009	DBLP DOI BibTeX RDF	tumor marker, bronchofibroscope, lung cancer Citation: Feifei Feng, Yongjun Wu, Chu Zhang, Yiming Wu, Application of Artificial Neural Network Model Established by Tumor Markers and Bronchofibroscopic Data in Auxiliary Diagnosis of Lung Cancer, icnc, vol. 2, pp.118-125, 2009 Fifth International Conference on Natural Computation, 2009 Peer Review Notice, Give Us Feedback Usage of this product signifies your acceptance of the Terms of Use. var addtoMethod=1, var AddURL = escape(http://doi.ieeecomputersociety.org/), var AddTitle = escape(Application of Artificial Neural Network Model Established by Tumor Markers and Bronchofibroscopic Data in Auxiliary Diagnosis of Lung Cancer), var savedIndex = 0, function openLinks(pPackageTitle,title,pProductTitle, index) { var productId = escape(916), var pubYear = escape(2009), var volume = escape(2), var issueNo = escape(2), var packageTitle = escape(2009 Fifth International Conference on Natural Computation), var productTitle = escape(International Conference on Natural Computation), var acronymTemp = escape(ICNC), var bcPageName = escape(I), var pubType = escape(p), var linkToYear=escape(/plugins/dl/years/916), var linkToIssue=escape(/plugins/dl/years/916?year=2009&vol=2), var linkToTOC=escape(/plugins/dl/toc/7230), var linkToAbstract = escape(/plugins/dl/doi/10.1109/ICNC.2009.635), var journalPage = escape(i), var abbrevTitle = escape(icnc), var yearTitle = escape(2009), var issueTitle = 'Issue No. ' + issueNo + ' - ' + packageTitle, var absTitle = escape(Application of Artificial Neural Network Model Established by Tumor Markers and Bronchofibroscopic Data in Auxiliary Diagnosis of Lung Cancer), if(pubType == m) { var breadcrumbs = new BreadCrumbs('/portal/web/csdl/magazines/' + journalPage), } else if (pubType == t) { var breadcrumbs = new BreadCrumbs('/portal/web/csdl/transactions/' + journalPage), } else if (pubType == l) { var breadcrumbs = new BreadCrumbs('/portal/web/csdl/letters/' + journalPage), } else { var breadcrumbs = new BreadCrumbs('/portal/web/csdl/proceedings/' + journalPage), } if (pubYear == 5555) { if(issueNo == 1) { if(abbrevTitle != cal) { breadcrumbs.add('PrePrints', linkToTOC, 1), } } else if(issueNo == 2) { breadcrumbs.add('RapidPosts', linkToTOC, 1), } else { }, } else if(pubType == p) { breadcrumbs.add(pProductTitle, linkToYear, 1), breadcrumbs.add(yearTitle, linkToYear + '?year=' + pubYear + '&vol=' + volume, 2), breadcrumbs.add(pPackageTitle,linkToTOC, 3), breadcrumbs.add(title , linkToAbstract, 4), } else { breadcrumbs.add(yearTitle, linkToYear + '?year=' + pubYear + '&vol=' + volume, 1), breadcrumbs.add(issueTitle,linkToTOC, 2), breadcrumbs.add('Abstract - '+ title , linkToAbstract, 3), } if(pubType == m) { //document.location = /portal/web/csdl/magazines/ + journalPage, var urlLocation = location.protocol + '//' + location.host + '/portal/web/csdl/magazines/' + journalPage, } else if (pubType == t) { var urlLocation = location.protocol + '//' + location.host + '/portal/web/csdl/transactions/' + journalPage, //document.location = /portal/web/csdl/transactions/ + journalPage, } else if (pubType == l) { var urlLocation = location.protocol + '//' + location.host + '/portal/web/csdl/letters/' + journalPage, //document.location = /portal/web/csdl/letters/ + journalPage, } else { var urlLocation = location.protocol + '//' + location.host + '/portal/web/csdl/proceedings/' + journalPage, //document.location = /portal/web/csdl/proceedings/ + journalPage, } } Open Download Liferay.Portlet.onLoad({ canEditTitle: false, columnPos: 1, isStatic: 'end', namespacedId: 'p_p_id_digitallibraryabstract_WAR_plugins_INSTANCE_uxob_', portletId: 'digitallibraryabstract_WAR_plugins_INSTANCE_uxob' }), //, Math.floor(Math.random()*1E16), document.write('')&rrc=2" title="Search for publications containing 'tile=3,sz=300x250,336x280,ord=' + ord + '?></script>')'">tile=3,sz=300x250,336x280,ord=' + ord + '?>'), //]]> Liferay.Portlet.onLoad({ canEditTitle: false, columnPos: 2, isStatic: 'end', namespacedId: 'p_p_id_56_INSTANCE_T3mf_', portletId: '56_INSTANCE_T3mf' }), Artificial neural networks, setTimeout(window.location.href = ' + urlLocation + ', 0), setTimeout(window.location.href = ' + urlLocation + ', 0), setTimeout(window.location.href = ' + urlLocation + ', 0), setTimeout(window.location.href = ' + urlLocation + ', 0), breadcrumbs.setLastIndex(index-1), breadcrumbs.setLastIndex(index-1), breadcrumbs.setLastIndex(index-1), breadcrumbs.setLastIndex(index-1), //breadcrumbs.select(index), //breadcrumbs.select(index), //breadcrumbs.select(index), //breadcrumbs.select(index), breadcrumbs.add('Abstract - '+ title , linkToAbstract, 2), breadcrumbs.add('Abstract - '+ title , linkToAbstract, 2)
477	Sushama P. Patil, Amol C. Goje	The Effect of Developments in Student Attributes on Success in Programming of Management Students.	ICETC	2009	DBLP DOI BibTeX RDF	mathematical aptitude, performance consistence in mathematics etc Citation: Sushama P. Patil, Amol C. Goje, The Effect of Developments in Student Attributes on Success in Programming of Management Students, icetc, pp.191-193, 2009 International Conference on Education Technology and Computer, 2009 Peer Review Notice, Give Us Feedback Usage of this product signifies your acceptance of the Terms of Use. var addtoMethod=1, var AddURL = escape(http://doi.ieeecomputersociety.org/), var AddTitle = escape(The Effect of Developments in Student Attributes on Success in Programming of Management Students), var savedIndex = 0, function openLinks(pPackageTitle,title,pProductTitle, index) { var productId = escape(1629), var pubYear = escape(2009), var volume = escape(0), var issueNo = escape(0), var packageTitle = escape(2009 International Conference on Education Technology and Computer), var productTitle = escape(Education Technology and Computer, International Conference on), var acronymTemp = escape(ICETC), var bcPageName = escape(I), var pubType = escape(p), var linkToYear=escape(/plugins/dl/years/1629), var linkToIssue=escape(/plugins/dl/years/1629?year=2009&vol=0), var linkToTOC=escape(/plugins/dl/toc/6836), var linkToAbstract = escape(/plugins/dl/doi/10.1109/ICETC.2009.35), var journalPage = escape(i), var abbrevTitle = escape(icetc), var yearTitle = escape(2009), var issueTitle = 'Issue No. ' + issueNo + ' - ' + packageTitle, var absTitle = escape(The Effect of Developments in Student Attributes on Success in Programming of Management Students), if(pubType == m) { var breadcrumbs = new BreadCrumbs('/portal/web/csdl/magazines/' + journalPage), } else if (pubType == t) { var breadcrumbs = new BreadCrumbs('/portal/web/csdl/transactions/' + journalPage), } else if (pubType == l) { var breadcrumbs = new BreadCrumbs('/portal/web/csdl/letters/' + journalPage), } else { var breadcrumbs = new BreadCrumbs('/portal/web/csdl/proceedings/' + journalPage), } if (pubYear == 5555) { if(issueNo == 1) { if(abbrevTitle != cal) { breadcrumbs.add('PrePrints', linkToTOC, 1), } } else if(issueNo == 2) { breadcrumbs.add('RapidPosts', linkToTOC, 1), } else { }, } else if(pubType == p) { breadcrumbs.add(pProductTitle, linkToYear, 1), breadcrumbs.add(yearTitle, linkToYear + '?year=' + pubYear + '&vol=' + volume, 2), breadcrumbs.add(pPackageTitle,linkToTOC, 3), breadcrumbs.add(title , linkToAbstract, 4), } else { breadcrumbs.add(yearTitle, linkToYear + '?year=' + pubYear + '&vol=' + volume, 1), breadcrumbs.add(issueTitle,linkToTOC, 2), breadcrumbs.add('Abstract - '+ title , linkToAbstract, 3), } if(pubType == m) { //document.location = /portal/web/csdl/magazines/ + journalPage, var urlLocation = location.protocol + '//' + location.host + '/portal/web/csdl/magazines/' + journalPage, } else if (pubType == t) { var urlLocation = location.protocol + '//' + location.host + '/portal/web/csdl/transactions/' + journalPage, //document.location = /portal/web/csdl/transactions/ + journalPage, } else if (pubType == l) { var urlLocation = location.protocol + '//' + location.host + '/portal/web/csdl/letters/' + journalPage, //document.location = /portal/web/csdl/letters/ + journalPage, } else { var urlLocation = location.protocol + '//' + location.host + '/portal/web/csdl/proceedings/' + journalPage, //document.location = /portal/web/csdl/proceedings/ + journalPage, } } Open Download Liferay.Portlet.onLoad({ canEditTitle: false, columnPos: 1, isStatic: 'end', namespacedId: 'p_p_id_digitallibraryabstract_WAR_plugins_INSTANCE_uxob_', portletId: 'digitallibraryabstract_WAR_plugins_INSTANCE_uxob' }), //, Math.floor(Math.random()*1E16), document.write('')&rrc=3" title="Search for publications containing 'tile=3,sz=300x250,336x280,ord=' + ord + '?></script>')'">tile=3,sz=300x250,336x280,ord=' + ord + '?>'), //]]> Liferay.Portlet.onLoad({ canEditTitle: false, columnPos: 2, isStatic: 'end', namespacedId: 'p_p_id_56_INSTANCE_T3mf_', portletId: '56_INSTANCE_T3mf' }), spatial ability, setTimeout(window.location.href = ' + urlLocation + ', 0), setTimeout(window.location.href = ' + urlLocation + ', 0), setTimeout(window.location.href = ' + urlLocation + ', 0), setTimeout(window.location.href = ' + urlLocation + ', 0), breadcrumbs.setLastIndex(index-1), breadcrumbs.setLastIndex(index-1), breadcrumbs.setLastIndex(index-1), breadcrumbs.setLastIndex(index-1), //breadcrumbs.select(index), //breadcrumbs.select(index), //breadcrumbs.select(index), //breadcrumbs.select(index), breadcrumbs.add('Abstract - '+ title , linkToAbstract, 2), breadcrumbs.add('Abstract - '+ title , linkToAbstract, 2)
172	Yang Liu	An Analysis of Corporation Debt Financing Based on the Comparison with Equity.	CSO (2)	2009	DBLP DOI BibTeX RDF
144	Murtuza Jadliwala, Sheng Zhong 0002, Shambhu J. Upadhyaya, Chunming Qiao, Jean-Pierre Hubaux	Secure Distance-Based Localization in the Presence of Cheating Beacon Nodes.	IEEE Trans. Mob. Comput.	2010	DBLP DOI BibTeX RDF	distance-based localization, security, Wireless networks
144	Mohammad Tehranipoor, Farinaz Koushanfar	A Survey of Hardware Trojan Taxonomy and Detection.	IEEE Des. Test Comput.	2010	DBLP DOI BibTeX RDF	hardware Trojans, Trojan taxonomy and detection, security, design and test, ICs
144	Ayaz Khan, Uffe Kock Wiil, Nasrullah Memon	Digital Forensics and Crime Investigation: Legal Issues in Prosecution at National Level.	SADFE	2010	DBLP DOI BibTeX RDF	Cyber Laws, Electronic Devices, Digital Forensics, Digital Evidence, Forensic Analysis
144	Arthur C. Graesser, Xiangen Hu, Natalie K. Person	Teaching with the Help of Talking Heads.	ICALT	2001	DBLP DOI BibTeX RDF
144	Piet Kommers	Genres, User Attitude and Prospects for Learning through Video on the WWW.	ICALT	2001	DBLP DOI BibTeX RDF
144	Barry Kort, Rob Reilly, Rosalind W. Picard	An Affective Model of Interplay between Emotions and Learning: Reengineering Educational Pedagogy - Building a Learning Companion.	ICALT	2001	DBLP DOI BibTeX RDF
144	Juan E. Gilbert, Dale-Marie Wilson	Domain Instruction Server (DIS).	ICALT	2001	DBLP DOI BibTeX RDF
144	June M. Abbas, Cathleen A. Norris, Elliot Soloway	Analyzing Middle School Students' Use of the ARTEMIS Digital Library.	ICALT	2001	DBLP DOI BibTeX RDF
144	Chiung-Hui Chiu	The Authority Structure Problem of Computer Supported Collaborative Concept Mapping System for Elementary Students.	ICALT	2001	DBLP DOI BibTeX RDF
144	Brian M. Slator, Jeffrey T. Clark, Paul Juell, Philip E. McClean, Bernhardt Saini-Eidukat, Donald P. Schwert, Alan R. White	Research on Role-Based Learning Technologies.	ICALT	2001	DBLP DOI BibTeX RDF
144	Kan-Min Lin, Nian-Shing Chen	Exploring Learning Problems of Cyber University.	ICALT	2001	DBLP DOI BibTeX RDF
144	Germana M. da Nóbrega, Stefano A. Cerri, Jean Sallantin	DIAL: Serendipitous DIAlectic Learning.	ICALT	2001	DBLP DOI BibTeX RDF
144	Chris Quintana, Joseph Krajcik, Elliot Soloway	Issues and Methods for Evaluating Learner-Centered Scaffolding.	ICALT	2001	DBLP DOI BibTeX RDF
144	Rocío García Robles	Promoting the Introduction of Lifelong Learning Related Concepts in the Description of Information Resources Using Metadata Technology.	ICALT	2001	DBLP DOI BibTeX RDF
139	Kyungwoo Lee, Xing Fang, Samuel P. Midkiff	Practical escape analyses: how good are they?	VEE	2007	DBLP DOI BibTeX RDF	analysis precision, Java, dynamic compilation, escape analysis
94	Rui Shi 0003, Chung-Kuan Cheng	Efficient escape routing for hexagonal array of high density I/Os.	DAC	2006	DBLP DOI BibTeX RDF	BGA, flip chip, hexagonal array, escape routing
82	Lijuan Luo, Tan Yan, Qiang Ma 0002, Martin D. F. Wong, Toshiyuki Shibuya	B-escape: a simultaneous escape routing algorithm based on boundary routing.	ISPD	2010	DBLP DOI BibTeX RDF	PCB routing, dense circuit boards, computer-aided design, escape routing
79	Peter Molnar, Andreas Krall, Florian Brandner	Stack allocation of objects in the CACAO virtual machine.	PPPJ	2009	DBLP DOI BibTeX RDF	object allocation on stack, just-in-time compiler, escape analysis
78	John Whaley, Martin C. Rinard	Compositional Pointer and Escape Analysis for Java Programs.	OOPSLA	1999	DBLP DOI BibTeX RDF	Java
76	Thomas Kotzmann, Hanspeter Mössenböck	Escape analysis in the context of dynamic compilation and deoptimization.	VEE	2005	DBLP DOI BibTeX RDF	deoptimization, scalar replacement, stack allocation, synchronization removal, Java, optimization, just-in-time compilation, escape analysis
69	Matthew Q. Beers, Christian H. Stork, Michael Franz	Efficiently Verifiable Escape Analysis.	ECOOP	2004	DBLP DOI BibTeX RDF
67	Kyungwoo Lee, Samuel P. Midkiff	A two-phase escape analysis for parallel java programs.	PACT	2006	DBLP DOI BibTeX RDF	compilation models, java, memory models, consistency models, escape analysis
61	Muhammet Mustafa Ozdal, Martin D. F. Wong, Philip S. Honsinger	Optimal routing algorithms for rectilinear pin clusters in high-density multichip modules.	ACM Trans. Design Autom. Electr. Syst.	2008	DBLP DOI BibTeX RDF	multi-chip modules, network flow, Escape routing
60	Koji Yatani, Kurt Partridge, Marshall W. Bern, Mark W. Newman	Escape: a target selection technique using visually-cued gestures.	CHI	2008	DBLP DOI BibTeX RDF	finger gesture, mobile device, touch screen, target selection
60	Patricia M. Hill, Fausto Spoto	Deriving escape analysis by abstract interpretation.	High. Order Symb. Comput.	2006	DBLP DOI BibTeX RDF	Garbage collection, Abstract interpretation, Denotational semantics
60	Patricia M. Hill, Fausto Spoto	A Foundation of Escape Analysis.	AMAST	2002	DBLP DOI BibTeX RDF
60	Young Gil Park, Benjamin Goldberg	Escape Analysis on Lists.	PLDI	1992	DBLP DOI BibTeX RDF
60	Benjamin Goldberg, Young Gil Park	Higher Order Escape Analysis: Optimizing Stack Allocation in Functional Program Implementations.	ESOP	1990	DBLP DOI BibTeX RDF
58	Renshen Wang, Rui Shi 0003, Chung-Kuan Cheng	Layer minimization of escape routing in area array packaging.	ICCAD	2006	DBLP DOI BibTeX RDF	bottleneck analysis, central triangular pattern, escape routing
54	Naoto Mukai, Toyohide Watanabe, Jun Feng 0001	Avoidance of Traffic Delay for Panicking Crowds Subject to Information Propagation.	KES (2)	2007	DBLP DOI BibTeX RDF
52	Ajeet Shankar, Matthew Arnold, Rastislav Bodík	Jolt: lightweight dynamic analysis and removal of object churn.	OOPSLA	2008	DBLP DOI BibTeX RDF	allocation optimization, selective optimization, java, virtual machine, churn, inlining, escape analysis
51	Qichang Chen, Liqiang Wang, Zijiang Yang 0006	HEAT: An Integrated Static and Dynamic Approach for Thread Escape Analysis.	COMPSAC (1)	2009	DBLP DOI BibTeX RDF
51	Tzung-Pei Hong, Min-Thai Wu, Ya-Fang Tung, Shyue-Liang Wang	Using escape operations in gene-set genetic algorithms.	SMC	2007	DBLP DOI BibTeX RDF
51	Hui Kong 0002, Tan Yan, Martin D. F. Wong, Muhammet Mustafa Ozdal	Optimal bus sequencing for escape routing in dense PCBs.	ICCAD	2007	DBLP DOI BibTeX RDF
51	Muhammet Mustafa Ozdal	Escape Routing For Dense Pin Clusters In Integrated Circuits.	DAC	2007	DBLP DOI BibTeX RDF
51	Chi-Leung Wong, Zehra Sura, Xing Fang, Kyungwoo Lee, Samuel P. Midkiff, Jaejin Lee, David A. Padua	Evaluating the Impact of Thread Escape Analysis on a Memory Consistency Model-Aware Compiler.	LCPC	2005	DBLP DOI BibTeX RDF
51	Patricia M. Hill, Fausto Spoto	A Refinement of the Escape Property.	VMCAI	2002	DBLP DOI BibTeX RDF
51	Amie L. Souter, Lori L. Pollock	Putting Escape Analysis to Work for Software Testing.	ICSM	2002	DBLP DOI BibTeX RDF
50	Irith Pomeranz, Sudhakar M. Reddy	On improving genetic optimization based test generation.	ED&TC	1997	DBLP DOI BibTeX RDF	propagation Citation: I. Pomeranz, S.M. Reddy, On improving genetic optimization based test generation, edtc, pp.506, 1997 European Design and Test Conference (ED&TC '97), 1997 Peer Review Notice, Give Us Feedback Usage of this product signifies your acceptance of the Terms of Use. var addtoMethod=1, var AddURL = escape(http://doi.ieeecomputersociety.org/), var AddTitle = escape(On improving genetic optimization based test generation), Open Download Liferay.Portlet.onLoad({ canEditTitle: false, columnPos: 1, isStatic: 'end', namespacedId: 'p_p_id_digitallibraryabstract_WAR_plugins_INSTANCE_DjbO_', portletId: 'digitallibraryabstract_WAR_plugins_INSTANCE_DjbO' }), genetic algorithms, test generation, fault coverage, activation, benchmark circuit, crossover operator, genetic optimization
49	Jin-Tai Yan, Chung-Wei Ke, Zhi-Wei Chen	Ordered escape routing via routability-driven pin assignment.	ACM Great Lakes Symposium on VLSI	2010	DBLP DOI BibTeX RDF	pcb design, routability, escape routing, pin assignment
49	Tsai-Duan Lin, Chiun-Chieh Hsu, Da-Ren Chen, Sheng-Yung Chiu	A New Ant Colony Optimization Algorithm with an Escape Mechanism for Scheduling Problems.	ICCCI	2009	DBLP DOI BibTeX RDF	escape mechanism, scheduling, optimization, makespan, Ant colony, combinatorial
49	Tan Yan, Martin D. F. Wong	A correct network flow model for escape routing.	DAC	2009	DBLP DOI BibTeX RDF	PCB routing, diagonal capacity, missing pin, package routing, network flow, escape routing
49	Lei Wang, Xikun Sun	Escape analysis for synchronization removal.	SAC	2006	DBLP DOI BibTeX RDF	synchronization removal, java, optimization, escape analysis
49	Jong-Deok Choi, Manish Gupta 0002, Mauricio J. Serrano, Vugranam C. Sreedhar, Samuel P. Midkiff	Stack allocation and synchronization optimizations for Java using escape analysis.	ACM Trans. Program. Lang. Syst.	2003	DBLP DOI BibTeX RDF	points-to graph, escape analysis, Connection graphs
49	Hugo Cheung, Sandeep K. Gupta 0001	A Framework to Minimize Test Escape and Yield Loss during IDDQ Testing: A Case Study.	VTS	2000	DBLP DOI BibTeX RDF	critical severity, test escape, fault modeling, IDDQ, yield loss
42	Aiwu Shi, Gleb Naumovich	Field Escape Analysis for Data Confidentiality in Java Components.	APSEC	2007	DBLP DOI BibTeX RDF
42	Carsten Wegener, Michael Peter Kennedy	Test Development Through Defect and Test Escape Level Estimation for Data Converters.	J. Electron. Test.	2006	DBLP DOI BibTeX RDF	mixed-signal and analog test, economics of test, test and post-test data analysis
42	Erez A. Ezrachi	Computational model of the cockroach escape behavior: winner and losers in a population code.	Biol. Cybern.	2003	DBLP DOI BibTeX RDF
42	Bruno Blanchet	Escape analysis for JavaTM: Theory and practice.	ACM Trans. Program. Lang. Syst.	2003	DBLP DOI BibTeX RDF	stack allocation, synchronization elimination, Java, optimization, static analysis
42	Toshinori Takabatake, Masato Kitakami, Hideo Ito	Escape and Restoration Routing: Suspensive Deadlock Recovery in Interconnection Networks.	PRDC	2001	DBLP DOI BibTeX RDF
41	Bo Chen 0002, Mike Paterson, Guochuan Zhang (eds.)	Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang	Lower Bounds on Edge Searching.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Shuguang Han, Yiwei Jiang, Jueliang Hu	Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Xiaolin Xu, Xiaoqiang Cai, Chunlin Liu, Chikit To	Optimal Commodity Distribution for a Vehicle with Fixed Capacity Under Vendor Managed Inventory.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Chao-Wen Chan, Chin-Chen Chang 0001	A New (t, n)-Threshold Scheme Based on Difference Equations.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Matthias Baumgart 0001, Stefan Eckhardt, Jan Griebsch, Sven Kosub, Johannes Nowak	All-Pairs Ancestor Problems in Weighted Dags.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Peng Cui 0008	A Tighter Analysis of Set Cover Greedy Algorithm for Test Set.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Jiong Guo	A More Effective Linear Kernelization for Cluster Editing.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Sungwook Kim, Sungchun Kim	Energy Efficient Heuristic Scheduling Algorithms for Multimedia Service.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi	On the L(h, k)-Labeling of Co-comparability Graphs.	ESCAPE	2007	DBLP DOI BibTeX RDF	L(h and k)-Labeling, co-comparability graphs, unit-interval graphs, interval graphs
41	Shuqiang Chen, Qizhi Fang	Call Control and Routing in SONET Rings.	ESCAPE	2007	DBLP DOI BibTeX RDF	SONET ring, routing, approximation algorithm, hard, call
41	Lingyu Sun, Ming Leng	An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Florian Diedrich, Klaus Jansen	An Approximation Algorithm for the General Mixed Packing and Covering Problem.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Geun-Cheol Lee, Jeff de Ropp, Mark R. Viant, David L. Woodruff, Ping Yu 0009	Heuristic Search for 2D NMR Alignment to Support Metabolite Identification.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Jiyun Niu, Huaxi Gu, Changshan Wang	A New Load Balanced Routing Algorithm for Torus Networks.	ESCAPE	2007	DBLP DOI BibTeX RDF	Routing, Interconnection networks, Torus
41	Xujin Chen, Jie Hu 0009, Xiaodong Hu 0001	On the Minimum Risk-Sum Path Problem.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Victor F. Cavalcante, Cid C. de Souza	Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Xiaobing Gan, Yanhong Gu, George L. Vairaktarakis, Xiaoqiang Cai, Quanle Chen	A Scheduling Problem with One Producer and the Bargaining Counterpart with Two Producers.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	György Dósa	The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9.	ESCAPE	2007	DBLP DOI BibTeX RDF	first fit decreasing, tight bound
41	Chang-Wu Yu 0001	Quantitative Analysis of Multi-hop Wireless Networks Using a Novel Paradigm.	ESCAPE	2007	DBLP DOI BibTeX RDF	subgraph counting, subgraph probability, Random geometric graphs
41	Wenqi Huang, Kun He 0001	An Efficient Algorithm for Solving the Container Loading Problem.	ESCAPE	2007	DBLP DOI BibTeX RDF	Cargo Loading, Heuristic, Cutting and Packing
41	Yong Wu, Zhiyi Tan 0001, Qifan Yang	Optimal Semi-online Scheduling Algorithms on a Small Number of Machines.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Johannes Fischer 0001, Volker Heun	A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Sumit Ganguly, Anirban Majumder	CR-precis: A Deterministic Summary Structure for Update Data Streams.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Longcheng Liu, Enyu Yao	Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance.	ESCAPE	2007	DBLP DOI BibTeX RDF	Min-max spanning tree, Inverse problem, Hamming distance, Strongly polynomial algorithms
41	Saverio Caminiti, Emanuele G. Fusco, Rossella Petreschi	A Bijective Code for k -Trees with Linear Time Encoding and Decoding.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Yiwei Jiang, An Zhang 0001, Zhiyi Tan 0001	Online Coupon Consumption Problem.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Weimin Ma, Ke Wang 0004	On the On-Line Weighted k-Taxi Problem.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Weimin Miao, Hongxia Yin, Donglei Du, Jiye Han	Robust Optimization Model for a Class of Uncertain Linear Programs.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Manying Bai, Lujie Sun	Application of Copula and Copula-CVaR in the Multivariate Portfolio Optimization.	ESCAPE	2007	DBLP DOI BibTeX RDF	CVaR, Portfolio Optimization, Copula, GARCH
41	Leah Epstein, Thomas Erlebach, Asaf Levin	Online Capacitated Interval Coloring.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Yanxiang He, Haowen Liu	Market-Based Service Selection Framework in Grid Computing.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Chin-Chen Chang 0001, Yih-Shin Hu, Chia-Chen Lin 0001	A Digital Watermarking Scheme Based on Singular Value Decomposition.	ESCAPE	2007	DBLP DOI BibTeX RDF	rightful ownership, singular value decomposition, digital watermark
41	Jin Wook Kim, Eunsang Kim, Kunsoo Park	Fast Matching Method for DNA Sequences.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Xiao-Jun Shi	Model Futility and Dynamic Boundaries with Application in Banking Default Risk Modeling.	ESCAPE	2007	DBLP DOI BibTeX RDF	Model Risk, Futility, Banking
41	Feng Yue, Kuanquan Wang, Wangmeng Zuo	Informative Gene Selection and Tumor Classification by Null Space LDA for Microarray Data.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Michael Hoffmann 0002, S. Muthukrishnan 0001, Rajeev Raman	Streaming Algorithms for Data in Motion.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Guillaume Blin, Guillaume Fertin, Irena Rusu, Christine Sinoquet	Extending the Hardness of RNA Secondary Structure Comparison.	ESCAPE	2007	DBLP DOI BibTeX RDF	arc-annotated sequences, NP-hardness, computational biology, edit distance, RNA structures
41	Yueping Li	Constrained Cycle Covers in Halin Graphs.	ESCAPE	2007	DBLP DOI BibTeX RDF	Halin graph, algorithm, network, cycle cover
41	Peng Zhang 0008, Wenbo Zhao 0001	On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Yongqiang Shi, Deshi Ye	On-Line Bin Packing with Arbitrary Release Times.	ESCAPE	2007	DBLP DOI BibTeX RDF	Arbitrary release time, On-Line algorithm, Bin packing
41	Wolfgang W. Bein, José R. Correa, Xin Han	A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser	Sequential Vector Packing.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Jun Mao, Gang Cheng, Yanxiang He	Phrase-Based Statistical Language Modeling from Bilingual Parallel Corpus.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Min Jiang	Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach.	ESCAPE	2007	DBLP DOI BibTeX RDF
41	Chang-Wu Yu 0001	On the Complexity of the Max-Edge-Coloring Problem with Its Variants.	ESCAPE	2007	DBLP DOI BibTeX RDF	multi-graphs, bipartite graphs, algorithm design, edge coloring