Search results for "instances"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
76	Bryant A. Julstrom	Evolving heuristically difficult instances of combinatorial problems.	GECCO	2009	DBLP DOI BibTeX RDF	evolving difficult instances, problem instances, quadratic knapsack problem, heuristics
54	Fabrice Muhlenbach, Stéphane Lallich, Djamel A. Zighed	Identifying and Handling Mislabelled Instances.	J. Intell. Inf. Syst.	2004	DBLP DOI BibTeX RDF	mislabelled data, geometrical neighbourhood, removing instances, relabelling instances, filtering, supervised learning
49	Todor P. Stefanov, Bart Kienhuis, Ed F. Deprettere	Algorithmic transformation techniques for efficient exploration of alternative application instances.	CODES	2002	DBLP DOI BibTeX RDF	application instances, design space exploration, system-level design, algorithmic transformations
46	Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah	Solving difficult SAT instances in the presence of symmetry.	DAC	2002	DBLP DOI BibTeX RDF	difficult, faster, search, symmetry, SAT, CNF, speed-up, instances
45	Ruizhi Sun, Guangli Liu, Meilin Shi	The Specification of Workflow Activity Multiple Instances.	CSCWD	2006	DBLP DOI BibTeX RDF
45	Martin Mundhenk	NP-Hard Sets Have Many Hard Instances.	MFCS	1997	DBLP DOI BibTeX RDF
44	Chi-Chun Huang, Hahn-Ming Lee	A Novel Partial-Memory Learning Algorithm Based on Grey Relational Structure.	IDA	2003	DBLP DOI BibTeX RDF
42	Pavel Surynek	Solving Difficult SAT Instances Using Greedy Clique Decomposition.	SARA	2007	DBLP DOI BibTeX RDF	difficult instances, search, consistency, SAT, clique
41	Conglei Yao, Yongjian Yu, Sicong Shou, Xiaoming Li	Towards a global schema for web entities.	WWW	2008	DBLP DOI BibTeX RDF	attribute labels, entity instances, global attribute schema, web entities
41	René Beier, Berthold Vöcking	An Experimental Study of Random Knapsack Problems.	Algorithmica	2006	DBLP DOI BibTeX RDF	Random instances, Pareto optimality, Knapsack problem, Experimental study
40	György J. Simon, Vipin Kumar 0001, Zhi-Li Zhang	Semi-supervised approach to rapid and reliable labeling of large data sets.	KDD	2008	DBLP DOI BibTeX RDF	labeling data sets, semi-supervised learning, performance guarantees
38	Enrique Alfonseca, Marius Pasca, Enrique Robledo-Arnuncio	Acquisition of instance attributes via labeled and related instances.	SIGIR	2010	DBLP DOI BibTeX RDF	distributional similarities, instance attributes, labeled instances, unstructured text, information extraction
38	Paolo Terenziani	Temporal Reasoning with Classes and Instances of Events.	TIME	2002	DBLP DOI BibTeX RDF	Temporal constraints between classes and instances of events, Prediction, Consistency, Inheritance
37	Karen I. Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink	Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances.	IPCO	1999	DBLP DOI BibTeX RDF
36	Sven Graupner, Vadim E. Kotov, Holger Trinks	Resource-Sharing and Service Deployment in Virtual Data Centers.	ICDCS Workshops	2002	DBLP DOI BibTeX RDF
34	Seung Hwan Ryu, Fabio Casati, Halvard Skogsrud, Boualem Benatallah, Régis Saint-Paul	Supporting the dynamic evolution of Web service protocols in service-oriented architectures.	ACM Trans. Web	2008	DBLP DOI BibTeX RDF	ongoing instances, Web services, decision trees, change impact analysis, Business protocols, dynamic evolution
34	Monaldo Mastrolilli, Leonora Bianchi	Core Instances for Testing: A Case Study.	WEA	2003	DBLP DOI BibTeX RDF
33	Eric Chun, Zeshan Chishti, T. N. Vijaykumar	Shapeshifter: Dynamically changing pipeline width and speed to address process variations.	MICRO	2008	DBLP DOI BibTeX RDF
33	Wei Tang, Taghi M. Khoshgoftaar	Noise Identification with the k-Means Algorithm.	ICTAI	2004	DBLP DOI BibTeX RDF
33	Kevin Butler, Mark J. Clement, Quinn Snell	A Performance Broker for CORBA.	HPDC	1999	DBLP DOI BibTeX RDF
31	Michele Mazzucco, Marlon Dumas	Reserved or On-Demand Instances? A Revenue Maximization Model for Cloud Providers.	IEEE CLOUD	2011	DBLP DOI BibTeX RDF	Revenue Optimization, On Demand/Reserved Instances, Cloud Computing, SLAs, Power Efficiency
30	Jaime I. Dávila, Sudha Balla, Sanguthevar Rajasekaran	Fast and Practical Algorithms for Planted (l, d) Motif Search.	IEEE ACM Trans. Comput. Biol. Bioinform.	2007	DBLP DOI BibTeX RDF	Planted motif search problem, challenging instances, exact algorithms, branch and bound algorithms
30	Hridesh Rajan, Kevin J. Sullivan	Eos: instance-level aspects for integrated system design.	ESEC / SIGSOFT FSE	2003	DBLP DOI BibTeX RDF	design, integration, mediators, aspects, C#, instances
30	Calin Anton, Lane Olson	Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism.	Canadian AI	2009	DBLP DOI BibTeX RDF
30	Sarfraz Khurshid, Muhammad Zubair Malik, Engin Uzuncaova	An Automated Approach for Writing Alloy Specifications Using Instances.	ISoLA	2006	DBLP DOI BibTeX RDF
30	Joaquín Pérez Ortega, Rodolfo A. Pazos, Juan Frausto Solís, Gerardo Reyes Salgado, René Santaolaya Salgado, Héctor J. Fraire H., Laura Cruz Reyes	An Approach for Solving Very Large Scale Instances of the Design Distribution Problem for Distributed Database Systems.	ISSADS	2005	DBLP DOI BibTeX RDF
30	Luca Trevisan	Non-approximability results for optimization problems on bounded degree instances.	STOC	2001	DBLP DOI BibTeX RDF
29	Hojun Jaygarl, Sunghun Kim 0001, Tao Xie 0001, Carl K. Chang	OCAT: object capture-based automated testing.	ISSTA	2010	DBLP DOI BibTeX RDF	object capturing, object generation, object mutation, automated testing
29	Chumphol Bunkhumpornpat, Krung Sinapiromsaran, Chidchanok Lursinsap	Safe-Level-SMOTE: Safe-Level-Synthetic Minority Over-Sampling TEchnique for Handling the Class Imbalanced Problem.	PAKDD	2009	DBLP DOI BibTeX RDF	Class Imbalanced Problem, Safe Level, Over-sampling, SMOTE
29	Shichao Zhang 0001, Zhi Jin, Xiaofeng Zhu 0001	NIIA: Nonparametric Iterative Imputation Algorithm.	PRICAI	2008	DBLP DOI BibTeX RDF
29	Li Qin, Vijayalakshmi Atluri	Ontology-Guided Change Detection to the Semantic Web Data.	ER	2004	DBLP DOI BibTeX RDF
29	Tassos Dimitriou	A Wealth of SAT Distributions with Planted Assignments.	CP	2003	DBLP DOI BibTeX RDF
27	Haiyan Che, Wei Chen, Tie Feng, Jiachen Zhang	A Property Restriction Based Knowledge Merging Method.	WISM	2009	DBLP DOI BibTeX RDF	knowledge merging, property restriction based, equivalent instances recognition, ontology, Semantic Web
27	Ulrich Fößmeier, Michael Kaufmann 0001	On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results.	Algorithmica	2000	DBLP DOI BibTeX RDF	Random instances, Algorithms, Dynamic programming, implementation, Worst-case analysis, Rectilinear Steiner trees
27	Andrea Omicini, Antonio Natali	Object-Oriented Computations in Logic Programming.	ECOOP	1994	DBLP DOI BibTeX RDF	Integration of object-oriented and logic paradigms, state configuration, partially configured instances, meta-level constraints, abduction
26	Kazunari Sugiyama, Manabu Okumura	Semi-supervised Clustering for Word Instances and Its Effect on Word Sense Disambiguation.	CICLing	2009	DBLP DOI BibTeX RDF
26	Zhi-Hua Zhou, Yu-Yin Sun, Yu-Feng Li	Multi-instance learning by treating instances as non-I.I.D. samples.	ICML	2009	DBLP DOI BibTeX RDF
26	Yong Gao 0001	Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms.	SAT	2008	DBLP DOI BibTeX RDF
26	Carlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu	From High Girth Graphs to Hard Instances.	CP	2008	DBLP DOI BibTeX RDF
26	Jun Long, Jianping Yin, En Zhu, Wentao Zhao	Active Learning with Misclassification Sampling Using Diverse Ensembles Enhanced by Unlabeled Instances.	PAKDD	2008	DBLP DOI BibTeX RDF
26	Alexis Cabeda Faria, João Batista S. de Oliveira	Measuring aesthetic distance between document templates and instances.	ACM Symposium on Document Engineering	2006	DBLP DOI BibTeX RDF	measures, document, layout, aesthetics
26	Zvi Drezner, Peter M. Hahn, Éric D. Taillard	Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF	benchmarks, local search, quadratic assignment problem, branch & bound
26	Seraj Ahmad, Nikhil Jayakumar, Vijay Balasubramanian, Edward Hursey, Sunil P. Khatri, Rabi N. Mahapatra	X-Routing using Two Manhattan Route Instances.	ICCD	2005	DBLP DOI BibTeX RDF
26	Héctor J. Fraire H., Graciela Mora Guadalupe Castilla V., Arturo Hernández R., Claudia Gómez Santillán, Graciela Mora O., Arquimedes Godoy V.	A Model for the Distribution Design of Distributed Databases and an Approach to Solve Large Instances.	IWDC	2005	DBLP DOI BibTeX RDF
26	Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah	Solving difficult instances of Boolean satisfiability in the presence of symmetry.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2003	DBLP DOI BibTeX RDF
26	Ronald Fagin, Phokion G. Kolaitis, Lucian Popa 0001, Wang Chiew Tan	Reverse data exchange: coping with nulls.	PODS	2009	DBLP DOI BibTeX RDF	maximum recovery, quasi-inverse, data integration, data exchange, schema mapping, inverse, model management, chase
26	Matthias Englert, Heiko Röglin, Berthold Vöcking	Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract.	SODA	2007	DBLP BibTeX RDF
26	Bangyong Liang, Jie Tang 0001, Juan-Zi Li, Kehong Wang	SWARMS: A New Tool for Domain Exploration in Semantic Web.	SKG	2006	DBLP DOI BibTeX RDF
26	Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov	Optimal partitioners and end-case placers for standard-cell layout.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2000	DBLP DOI BibTeX RDF
24	Owen Eriksson, Paul Johannesson, Maria Bergholtz	The case for classes and instances - a response to representing instances: the case for reengineering conceptual modelling grammars.	Eur. J. Inf. Syst.	2019	DBLP DOI BibTeX RDF
24	Romain Brégier	Détection et estimation de pose d'instances d'objet rigide pour la manipulation robotisée. (Detection and pose estimation of instances of a rigid object for robotic bin-picking).		2018	RDF
24	Valentin Weber	Caractérisation des instances difficiles de problèmes d'optimisation NP-difficiles. (Characterization of difficult instances for NP-hard problems).		2013	RDF
24	Thomas Knauth, Christof Fetzer	Spot-on for Timed instances: Striking a Balance between Spot and On-demand Instances.	CGC	2012	DBLP DOI BibTeX RDF
24	Amir Anter, Shlomi Dolev	Optical solution for hard on average #P-complete instances (using exponential space for solving instances of the permanent).	Nat. Comput.	2010	DBLP DOI BibTeX RDF
24	Olivier Kuhn	Methodology for knowledge-based engineering template update : focus on decision support and instances update. (Méthodologie de mise-à-jour de knowledge-based engineering template : focus sur l'aide à la décision et la mise-à-jour des instances).		2010	RDF
24	Eric Nowak	Reconnaissance de catégories d'objets et d'instances d'objets à l'aide de représentations locales. (Local Feature Based Object Categories and Object Instances Recognition).		2008	RDF
23	Baohe Zuo, Sue Zheng, Hong Wu	Multi-issue Agent Negotiation Based on Fairness.	WISM	2009	DBLP DOI BibTeX RDF	interactive instances, Agent, fairness, satisfaction
23	Natalie Ebenreuter	Working towards an open source design approach for the development of collaborative design projects.	OZCHI	2009	DBLP DOI BibTeX RDF	open design, rationale instances, design decisions, open source development
23	María Pilar Tormos, Antonio Luis Lova, Federico Barber, Laura Paola Ingolotti, Montserrat Abril, Miguel A. Salido	A Genetic Algorithm for Railway Scheduling Problems.	Metaheuristics for Scheduling in Industrial and Manufacturing Applications	2008	DBLP DOI BibTeX RDF	Train Timetabling Problem, Parameterized Regret-Based Biased Random Sampling, Real World Instances, Genetic Algorithms, Scheduling
23	Philippe Chatalic, Laurent Simon	Multi-resolution on compressed sets of clauses.	ICTAI	2000	DBLP DOI BibTeX RDF	compressed sets, compressed clauses, propositional clauses, compression power, structured instances, specialized operator, clause sets, polynomial size data structures, ZREs system, Davis-Putnam procedure, hard problems, SAT provers, zero-suppressed binary decision diagrams, computational complexity, data structures, data structures, data compression, theorem proving, computability, encodings, directed graphs, binary decision diagrams, set theory, multi-resolution, cut eliminations, ZBDDs
23	Luong T. Nguyen, Liping Zhao 0001, Bill Appelbe	A Set Approach to Role Modeling.	TOOLS (37)	2000	DBLP DOI BibTeX RDF	set approach, role modeling techniques, role description, role binding, role constraints, set inclusion, role specialisation, role compositions, part role, set notation, dynamic description, class/role relationships, class/role structures, Object-Z-like notation, system obligations, Petri net transitions, objects/role instances, system operations, formal specification, formal method, Petri nets, object-oriented programming, object-oriented methods, set theory, EMS, graphic notations, dynamic aspects, set operations, set intersection, formal notation, set union, set unions, set difference
23	N. Mfourga	Extracting Entity-Relationship Schemas from Relational Databases: A Form-Driven Approach.	WCRE	1997	DBLP DOI BibTeX RDF	entity-relationship schema extraction, operational relational database, form model schemas, form-driven approach, data constraints, form structures, form instances, inference process, supplemented low-level schemas, conceptual schema reconstruction, entity-relationship modelling, structural information, human activity, database semantics
23	Wolfgang A. Halang, Kim-Fung Man, Matjaz Colnaric	A graphical paradigm facilitating correct programming of complex computer control systems.	ICECCS	1995	DBLP DOI BibTeX RDF	control engineering computing, graphical paradigm, correct programming, complex computer control systems, graphical software development paradigm, off-the-shelf application-oriented standard software function blocks, interconnection pattern, invoked function block instances, complexity, formal methods, graphical user interfaces, computer graphics, software metrics, firmware, firmware
23	Dov Dori, Erez Tatcher	Selective Multiple Inheritance.	IEEE Softw.	1994	DBLP DOI BibTeX RDF	selective multiple inheritance, embryonic class, class instances, ancestor subsets, combinatorial explosion, inheritance, object-oriented methods, object diagram, generalized method
23	John Esch	Contexts and Concepts, Abstraction Duals.	ICCS	1994	DBLP DOI BibTeX RDF	White Box, Relation Instances, Contexts, Aggregations, Contraction, Concepts, Conceptual Graphs, Expansion, Black Box, Individuals
23	Chao-Chih Yang, Jennifer Jau-Yin Chen, H. Lewis Chau	Algorithms for Constructing Minimal Deduction Graphs.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	MDG construction algorithms, Hern clauses, minimal deduction graphs, Horn clause logic, DG, Horn formulas, positive literals, rule instances, tree space, logic programming, graphs, expert systems, inference mechanisms, transitivity, backtracking, inference rules, reflexivity, arcs, sink, subtrees, HF
23	Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy	On the Structure of Industrial SAT Instances.	CP	2009	DBLP DOI BibTeX RDF
23	Pierre Senellart, Georg Gottlob	On the complexity of deriving schema mappings from database instances.	PODS	2008	DBLP DOI BibTeX RDF	complexity, match, data exchange, schema mapping, instance
23	Marco Tomassini, Leonardo Vanneschi	Negative Slope Coefficient and the Difficulty of Random 3-SAT Instances.	EvoWorkshops	2008	DBLP DOI BibTeX RDF
23	Mehrdad Nojoumian, Divya K. Nair	Comparing genetic algorithm and guided local search methods by symmetric TSP instances.	GECCO	2008	DBLP DOI BibTeX RDF	genetic algorithm, guided local search
23	Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard	Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality.	SOFSEM	2008	DBLP DOI BibTeX RDF	Bipartite perfect matching, Shortest path, Spanning tree, Robust optimization, Interval data
23	Rodrigo Gonçalves, Ronaldo dos Santos Mello	Improving XML Instances Comparison with Preprocessing Algorithms.	DEXA	2007	DBLP DOI BibTeX RDF
23	Manoranjan Dash, Ong Cher Yee	extraRelief: Improving Relief by Efficient Selection of Instances.	Australian Conference on Artificial Intelligence	2007	DBLP DOI BibTeX RDF
23	Miguel F. Anjos	An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs.	Ann. Math. Artif. Intell.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 90C22, 03B05, 90C09, 90C90, 68T15
23	Yuichi Nagata	New EAX Crossover for Large TSP Instances.	PPSN	2006	DBLP DOI BibTeX RDF
23	Antonia Bertolino, Jinghua Gao, Eda Marchetti, Andrea Polini	Systematic Generation of XML Instances to Test Complex Software Applications.	RISE	2006	DBLP DOI BibTeX RDF
23	Aaron N. Ng, Igor L. Markov, Rajat Aggarwal, Venky Ramachandran	Solving hard instances of floorplacement.	ISPD	2006	DBLP DOI BibTeX RDF	floorplacement, benchmarks, placement, floorplanning, RTL, circuit layout
23	Andreas Bortfeldt, Hermann Gehring	New Large Benchmark Instances for the Two-Dimensional Strip Packing Problem with Rectangular Pieces.	HICSS	2006	DBLP DOI BibTeX RDF
23	Erik Behrends, Oliver Fritzen, Wolfgang May	Handling Interlinked XML Instances on the Web.	EDBT	2006	DBLP DOI BibTeX RDF
23	Joaquín Pérez Ortega, Rodolfo A. Pazos Rangel, Jose A. Martinez Florez, Juan Javier González Barbosa, E. Alejandor Macias Diaz, Jesús David Terán Villanueva	Distribution Design in Distributed Databases Using Clustering to Solve Large Instances.	ISPA	2005	DBLP DOI BibTeX RDF
23	Myo-Myo Naing, Ee-Peng Lim, Roger H. L. Chiang	Core: A Search and Browsing Tool for Semantic Instances of Web Sites.	APWeb	2005	DBLP DOI BibTeX RDF
23	Sebastiano Vigna	Reachability Problems in Entity-Relationship Schema Instances.	ER	2004	DBLP DOI BibTeX RDF
23	Sathiamoorthy Subbarayan, Dhiraj K. Pradhan	NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
23	Bo Hu 0001, Srinandan Dasmahapatra, David Dupplaw, Paul H. Lewis, Nigel Shadbolt	Managing Patient Record Instances Using DL-Enabled Formal Concept Analysis.	EKAW	2004	DBLP DOI BibTeX RDF
23	Xin Xu, Eibe Frank	Logistic Regression and Boosting for Labeled Bags of Instances.	PAKDD	2004	DBLP DOI BibTeX RDF
23	Minqiang Li, Li Zhi	Learning DNF Concepts by Constrained Clustering of Positive Instances.	IAT	2003	DBLP DOI BibTeX RDF
23	Ola Angelsmark, Peter Jonsson, Svante Linusson, Johan Thapper	Determining the Number of Solutions to Binary CSP Instances.	CP	2002	DBLP DOI BibTeX RDF
23	Andrea Roli	Criticality and Parallelism in Structured SAT Instances.	CP	2002	DBLP DOI BibTeX RDF
23	Andrew P. Kosoresow, Matthew P. Johnson 0001	Finding Worst-Case Instances of, and Lower Bounds for, Online Algorithms Using Genetic Algorithms.	Australian Joint Conference on Artificial Intelligence	2002	DBLP DOI BibTeX RDF	genetic algorithms, Evolutionary algorithms, search, online algorithms, optimization algorithms
23	Joel Friedman, Andreas Goerdt	Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently.	ICALP	2001	DBLP DOI BibTeX RDF
23	Jian Zhang 0001, Chen Xu, S. C. Cheung 0001	Automatic Generation of Database Instances for White-box Testing.	COMPSAC	2001	DBLP DOI BibTeX RDF	embedded SQL, software testing, constraint solving, Database applications, automatic test data generation
23	Matteo Fischetti, Andrea Lodi 0001, Paolo Toth	Solving Real-World ATSP Instances by Branch-and-Cut.	Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
23	Andreas Goerdt, Michael Krivelevich	Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods.	STACS	2001	DBLP DOI BibTeX RDF
23	Richard J. Lorentz	Creating Difficult Instances of the Post Correspondence Problem.	Computers and Games	2000	DBLP DOI BibTeX RDF	transposition table, hash table, PCP, Post Correspondence Problem, single-agent search
23	Jack H. Lutz, Vikram Mhetre, Sridhar Srinivasan	Hard Instances of Hard Problems.	STACS	2000	DBLP DOI BibTeX RDF
23	Luís Baptista, João Marques-Silva 0001	Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability.	CP	2000	DBLP DOI BibTeX RDF
23	Dalila Tamzalit, Chabane Oussalah	Instances Evolution Vs Classes Evolution.	DEXA	1999	DBLP DOI BibTeX RDF
23	Edmund K. Burke, Jeffrey H. Kingston, Paul A. Pepper	A Standard Data Format for Timetabling Instances.	PATAT	1997	DBLP DOI BibTeX RDF
23	Miroslaw Kowaluk, Klaus W. Wagner	Vector Language: Simple Description of Hard Instances (Extended Abstract).	MFCS	1990	DBLP DOI BibTeX RDF
23	Gary Bray	Sharing code among instances of Ada generics.	SIGPLAN Symposium on Compiler Construction	1984	DBLP DOI BibTeX RDF