Search results for "instances"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
22	Dániel Marx	Tractable hypergraph properties for constraint satisfaction and conjunctive queries.	STOC	2010	DBLP DOI BibTeX RDF	submodular width, constraint satisfaction, conjunctive queries, fixed-parameter tractability
22	Nicolás García-Pedrajas	Constructing Ensembles of Classifiers by Means of Weighted Instance Selection.	IEEE Trans. Neural Networks	2009	DBLP DOI BibTeX RDF
22	Egon Balas, Anureet Saxena	Optimizing over the split closure.	Math. Program.	2008	DBLP DOI BibTeX RDF
22	Kerstin Bauer, Thomas Fischer 0003, Sven Oliver Krumke, Katharina Gerhardt, Stephan Westphal, Peter Merz	Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem.	EvoCOP	2008	DBLP DOI BibTeX RDF
22	Martin Pelikan, Helmut G. Katzgraber, Sigismund Kobe	Finding ground states of Sherrington-Kirkpatrick spin glasses with hierarchical boa and genetic algorithms.	GECCO	2008	DBLP DOI BibTeX RDF	hBOA, sherrington-kirkpatrick spin glass, sk spin glass, genetic algorithm, evolutionary computation, branch and bound, estimation of distribution algorithms, EDA, hierarchical boa
22	Nicole Bidoit, Matthieu Objois	SQTL: A Preliminary Proposal for a Temporal-to-Temporal Query Language.	TIME	2007	DBLP DOI BibTeX RDF	Temporal databases, temporal query languages
22	Sattar Hashemi, Ying Yang 0001, Majid Pourkashani, Mohammad Reza Kangavari 0001	To Better Handle Concept Change and Noise: A Cellular Automata Approach to Data Stream Classification.	Australian Conference on Artificial Intelligence	2007	DBLP DOI BibTeX RDF
22	Jason Amunrud, Bryant A. Julstrom	Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming.	GECCO	2006	DBLP DOI BibTeX RDF	binary quadratic programming, case injection, instance similarity, population seeding
22	Theodor Richardson, Song Wang 0002	Open-Curve Shape Correspondence Without Endpoint Correspondence.	MICCAI (1)	2006	DBLP DOI BibTeX RDF
22	Horst Samulowitz, Jessica Davies 0001, Fahiem Bacchus	Preprocessing QBF.	CP	2006	DBLP DOI BibTeX RDF
22	Franc Brglez, Xiao Yu Li, Matthias F. M. Stallmann	On SAT instance classes and a method for reliable performance experiments with SAT solvers.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	exponential and heavy-tail distributions, reliability function, satisfiability, experimental design, equivalence classes, conjunctive normal form
22	Jin Soung Yoo, Shashi Shekhar, Mete Celik	A Join-Less Approach for Co-Location Pattern Mining: A Summary of Results.	ICDM	2005	DBLP DOI BibTeX RDF
22	Manfred K. Warmuth, S. V. N. Vishwanathan	Leaving the Span.	COLT	2005	DBLP DOI BibTeX RDF
22	E. Michael Maximilien, Munindar P. Singh	Agent-based trust model involving multiple qualities.	AAMAS	2005	DBLP DOI BibTeX RDF	quality of service, multi agent systems, service-oriented architecture, trust, semantic web services, service-oriented computing, service selection
22	Dacheng Zhang, Jie Xu 0007	Multi-Party Authentication for Web Services: Protocols, Implementation and Evaluation.	ISORC	2004	DBLP DOI BibTeX RDF	security, Web services, fault tolerance, Authentication, key exchange, Internet computing
22	René Beier, Berthold Vöcking	Probabilistic analysis of knapsack core algorithms.	SODA	2004	DBLP BibTeX RDF
22	Veronica Biazzo, Rosalba Giugno, Thomas Lukasiewicz, V. S. Subrahmanian	Temporal Probabilistic Object Bases.	IEEE Trans. Knowl. Data Eng.	2003	DBLP DOI BibTeX RDF	Probabilistic databases, temporal data, uncertainty management
22	Soumen Chakrabarti, Shourya Roy, Mahesh V. Soundalgekar	Fast and accurate text classification via multiple linear discriminant projections pp.	VLDB J.	2003	DBLP DOI BibTeX RDF	Text classification, Discriminative learning, Linear discriminants
22	Tommaso Schiavinotto, Thomas Stützle	Search Space Analysis of the Linear Ordering Problem.	EvoWorkshops	2003	DBLP DOI BibTeX RDF
22	Ming Dong 0001, Ravi Kothari	Texture Based Look-Ahead for Decision-Tree Induction.	ICAPR	2001	DBLP DOI BibTeX RDF	Classification, Decision tree, Texture, Look-ahead
19	Simone Kriglstein	OWL Ontology Visualization: Graphical Representations of Properties on the Instance Level.	IV	2010	DBLP DOI BibTeX RDF	OWL Lite, Knoocks, graphical representation of instances, datatype properties, object properties, Information visualization
19	Hridesh Rajan, Kevin J. Sullivan	Unifying aspect- and object-oriented design.	ACM Trans. Softw. Eng. Methodol.	2009	DBLP DOI BibTeX RDF	Classpect, Eos, first class aspect instances, instance-level advising, unified aspect language model, aspect-oriented programming, binding
19	Thomas Schlegel	Object-Oriented Interactive Processes in Decentralized Production Systems.	HCI (8)	2009	DBLP DOI BibTeX RDF	Process Instances, User Interface, Workflow, Process Models, Meta-Models, Semantic Models, Production Systems, Decentralized Systems, User Interface Generation, Interactive Processes, Process Execution
19	Shuiping Gou, Yuqin Wang, Licheng Jiao, Jing Feng, Yao Yao	Distributed Transfer Network Learning Based Intrusion Detection.	ISPA	2009	DBLP DOI BibTeX RDF	Instances transfer learning, Intrusion detection, Distributed Network, Transfer Learning
19	Robin A. Moser	A constructive proof of the Lovász local lemma.	STOC	2009	DBLP DOI BibTeX RDF	bounded occurrence sat instances, hypergraph colouring, derandomization, Lovasz local lemma
19	Marek Karpinski, Warren Schudy	Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems.	STOC	2009	DBLP DOI BibTeX RDF	Gale-Berlekamp game, correlation and hierarchical clustering, dense instances, linear time approximation schemes, minimum constraint satisfaction, nearest codeword problem, approximation algorithms
19	Álvaro García-Sánchez, Luis Miguel Arreche Bedia, Miguel Ortega-Mier	Combining Simulation and Tabu Search for Oil-derivatives Pipeline Scheduling.	Metaheuristics for Scheduling in Industrial and Manufacturing Applications	2008	DBLP DOI BibTeX RDF	Multi-commodity Pipeline, Real World Instances, Simulation, Scheduling, Tabu Search
19	Davood Shamsi, Farinaz Koushanfar, Miodrag Potkonjak	Challenging benchmark for location discovery in ad hoc networks: foundations and applications.	MobiHoc	2008	DBLP DOI BibTeX RDF	add hoc networks, hard instances, localization, benchmarks, NP-complete problem
19	Shaowen Bardzell, Jeffrey Bardzell, Tyler Pace, Kayce N. Reed	Blissfully productive: grouping and cooperation in world of warcraft instance runs.	CSCW	2008	DBLP DOI BibTeX RDF	small groups, collaboration, mmog, leadership, mmorpg, world of warcraft, instances
19	Paolo Ceravolo, Ernesto Damiani, Marcello Leida	Ontology Robustness in Evolution.	OTM Workshops	2008	DBLP DOI BibTeX RDF	Migration of Instances, Ontology Evolution, Ontology Construction
19	Dat C. Ma, Joe Y.-C. Lin, Maria E. Orlowska	Automatic Merging of Work Items in Business Process Management Systems.	BIS	2007	DBLP DOI BibTeX RDF	Activity instances, Work items, Workflow, Grouping, Flexibility, Business Process Management, Merging
19	Dimitrios Koukopoulos, Yannis C. Stamatiou	A compressed-domain watermarking algorithm for mpeg audio layer 3.	MM&Sec	2001	DBLP DOI BibTeX RDF	hard instances, mpeg audio layer 3, threshold phenomena, NP-completeness, audio watermarking
19	James Allen Fill, Mark Huber	The Randomness Recycler: A New Technique for Perfect Sampling.	FOCS	2000	DBLP DOI BibTeX RDF	randomness recycler, perfect sampling, approximately random samples, output samples, target distribution, classical Markov chain approaches, RR-based algorithm, perfect sampling methods, restricted instances, first expected linear time algorithms, sample generation, self-organizing lists, random independent sets, random colorings, random cluster model, RR protocol, graph theory, probability, Markov chains, probability distributions, random processes, mixing time, sampling methods, Ising model, self-adjusting systems
19	Reda Alhajj, Faruk Polat	Closure Maintenance in An Object-Oriented Query Model.	CIKM	1994	DBLP DOI BibTeX RDF	message expression, object algebra expression, total instances, database system, closure, object-oriented data model, query model, object-oriented query language
19	Vishwani D. Agrawal, Srimat T. Chakradhar	Performance Analysis of Synchronized Iterative Algorithms on Multiprocessor Systems.	IEEE Trans. Parallel Distributed Syst.	1992	DBLP DOI BibTeX RDF	synchronized iterative algorithms, performanceevaluation technique, fixed probability, periodic instances, computational activity, binomial random variable, multiprocessorsystem, maximum order-statistic, theoretical performance, logicsimulation, production VLSI chips, performance evaluation, parallel algorithms, parallel processing, synchronizations, iterative methods, statistics, statistical model, atoms, random variables, computational effort, parallelmachines
19	Franck Le, Geoffrey G. Xie, Hui Zhang 0001	Theory and new primitives for safely connecting routing protocol instances.	SIGCOMM	2010	DBLP DOI BibTeX RDF	connecting primitives, route redistribution, route selection
19	Jiajie Xu 0001, Chengfei Liu, Xiaohui Zhao 0001	Resource Planning for Massive Number of Process Instances.	OTM Conferences (1)	2009	DBLP DOI BibTeX RDF
19	Heithem Abbes, Christophe Cérin, Mohamed Jemni	BonjourGrid: Orchestration of multi-instances of grid middlewares on institutional Desktop Grids.	IPDPS	2009	DBLP DOI BibTeX RDF
19	Martin Gruber, Günther R. Raidl	Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances.	GECCO	2009	DBLP DOI BibTeX RDF	bounded diameter minimum spanning tree, construction heuristics, greedy randomized search, local improvement, dynamic programming
19	Suwan Tongphu, Naddao Thongsak, Matthew N. Dailey	Rapid Detection of Many Object Instances.	ACIVS	2009	DBLP DOI BibTeX RDF	keypoint descriptors, bags of keypoints, clustering, Object detection, AdaBoost, visual words
19	Shan-Qing Guo, Zhong-Hua Zhao	An Anomaly Intrusion Detection Model Based on Limited Labeled Instances.	ISECS	2008	DBLP DOI BibTeX RDF	density-based clustering algorithm, Intrusion detection, k-means
19	Peter Merz, Jutta Huhse	An Iterated Local Search Approach for Finding Provably Good Solutions for Very Large TSP Instances.	PPSN	2008	DBLP DOI BibTeX RDF
19	Asim Munawar, Mohamed Wahib, Masaharu Munetomo, Kiyoshi Akama	Solving Large Instances of Capacitated Vehicle Routing Problem over Cell BE.	HPCC	2008	DBLP DOI BibTeX RDF
19	Juan Luis Jiménez Laredo, A. E. Eiben, Maarten van Steen, Pedro A. Castillo, Antonio Miguel Mora, Juan Julián Merelo Guervós	P2P Evolutionary Algorithms: A Suitable Approach for Tackling Large Instances in Hard Optimization Problems.	Euro-Par	2008	DBLP DOI BibTeX RDF
19	Yu Cao 0004, Gopal C. Das, Chee Yong Chan, Kian-Lee Tan	Optimizing complex queries with multiple relation instances.	SIGMOD Conference	2008	DBLP DOI BibTeX RDF	interleaved execution, shared scan, query processing, query optimization
19	Carsten Sinz	Visualizing SAT Instances and Runs of the DPLL Algorithm.	J. Autom. Reason.	2007	DBLP DOI BibTeX RDF	SAT instance, DPLL procedure
19	Antonio D. Masegosa, Alejandro Sancho-Royo, David A. Pelta	An Adaptive Metaheuristic for the Simultaneous Resolution of a Set of Instances.	NICSO	2007	DBLP DOI BibTeX RDF
19	Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Sais	Eliminating Redundant Clauses in SAT Instances.	CPAIOR	2007	DBLP DOI BibTeX RDF
19	David R. Karger, Krzysztof Onak	Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems.	SODA	2007	DBLP BibTeX RDF
19	Felix G. König, Marco E. Lübbecke, Rolf H. Möhring, Guido Schäfer, Ines Spenke	Solutions to Real-World Instances of PSPACE-Complete Stacking.	ESA	2007	DBLP DOI BibTeX RDF
19	Jiangwen Sun, Feng-ying Zhao, Chong-Jun Wang, Shifu Chen	Identifying and Correcting Mislabeled Training Instances.	FGCN (1)	2007	DBLP DOI BibTeX RDF
19	Thomas Fischer 0003, Peter Merz	Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges.	EvoCOP	2007	DBLP DOI BibTeX RDF
19	Patrick Briest, Piotr Krysta	Single-minded unlimited supply pricing on sparse instances.	SODA	2006	DBLP DOI BibTeX RDF
19	Min-Seok Kim, Jiang Hu	Associative skew clock routing for difficult instances.	DATE	2006	DBLP DOI BibTeX RDF
19	Danny Harnik, Moni Naor	On the Compressibility of NP Instances and Cryptographic Applications.	FOCS	2006	DBLP DOI BibTeX RDF
19	Hans van Maaren, Linda van Norden	Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	Horn, satisfiability, density, 3-SAT
19	Jano I. van Hemert	Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution.	EvoCOP	2005	DBLP DOI BibTeX RDF
19	Carsten Sinz, Edda-Maria Dieringer	DPvis - A Tool to Visualize the Structure of SAT Instances.	SAT	2005	DBLP DOI BibTeX RDF
19	Norbert Jankowski, Marek Grochowski	Comparison of Instances Seletion Algorithms I. Algorithms Survey.	ICAISC	2004	DBLP DOI BibTeX RDF
19	Grzegorz Malewicz	A Method for Creating Near-Optimal Instances of a Certified Write-All Algorithm (Extended Abstract).	ESA	2003	DBLP DOI BibTeX RDF
19	Béla Csaba, Marek Karpinski, Piotr Krysta	Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems.	SODA	2002	DBLP BibTeX RDF
19	Wenhui Zhang, Zhuo Huang, Jian Zhang 0001	Parallel Execution of Stochastic Search Procedures on Reduced SAT Instances.	PRICAI	2002	DBLP DOI BibTeX RDF
19	Marek Karpinski	Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems.	Algorithmica	2001	DBLP DOI BibTeX RDF
19	Charles J. Alpert, Milos Hrkic, Jiang Hu, Andrew B. Kahng, John Lillis, Bao Liu 0001, Stephen T. Quay, Sachin S. Sapatnekar, A. J. Sullivan, Paul Villarrubia	Buffered Steiner trees for difficult instances.	ISPD	2001	DBLP DOI BibTeX RDF
19	Catharine M. Wyss, Chris Giannella, Edward L. Robertson	FastFDs: A Heuristic-Driven, Depth-First Algorithm for Mining Functional Dependencies from Relation Instances - Extended Abstract.	DaWaK	2001	DBLP DOI BibTeX RDF
19	Gunnar Andersson, Lars Engebretsen	Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems.	RANDOM	1998	DBLP DOI BibTeX RDF
19	Christoph Karg, Johannes Köbler, Rainer Schuler	The Complexity of Generating Test Instances.	STACS	1997	DBLP DOI BibTeX RDF
19	Susan Bodily, David W. Embley, Scott N. Woodfield	Implementing OSA Model Instances in Ada.	TRI-Ada	1994	DBLP DOI BibTeX RDF	Ada
19	Joan Feigenbaum	Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him?	CRYPTO	1985	DBLP DOI BibTeX RDF
18	Mohammad M. Masud 0001, Jing Gao 0004, Latifur Khan, Jiawei Han 0001, Bhavani Thuraisingham	Integrating Novel Class Detection with Classification for Concept-Drifting Data Streams.	ECML/PKDD (2)	2009	DBLP DOI BibTeX RDF
18	Wei-Yi Yu, Hahn-Ming Lee	An Incremental-Learning Method for Supervised Anomaly Detection by Cascading Service Classifier and ITI Decision Tree Methods.	PAISI	2009	DBLP DOI BibTeX RDF	anomaly detection system (ADS), Kohonens’ self-organizing maps (SOM), ITI (incremental tree inducer), KDD’99, K-Means clustering
18	Yoo Jung An, Soon Ae Chun, Kuo-Chuan Huang, James Geller	Enriching Ontology for Deep Web Search.	DEXA	2008	DBLP DOI BibTeX RDF	Instance Extraction, Semantic Web, Deep Web, Domain Ontology
18	Kouji Kozaki, Satoshi Endo, Riichiro Mizoguchi	Instance Management Problems in the Role Model of Hozo.	PRICAI	2008	DBLP DOI BibTeX RDF	instance management, role theory, Ontology, ontology modeling
18	Wentao Zhao, Jun Long, En Zhu, Yun Liu	A Scalable Algorithm for Graph-Based Active Learning.	FAW	2008	DBLP DOI BibTeX RDF	Graph-based Learning, Active Learning
18	Gregory Druck, Gideon S. Mann, Andrew McCallum	Learning from labeled features using generalized expectation criteria.	SIGIR	2008	DBLP DOI BibTeX RDF	labeled features, learning with domain knowledge, text classification, semi-supervised learning
18	Gerold Jäger, Paul Molitor	Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order.	COCOA	2008	DBLP DOI BibTeX RDF	Traveling Salesman Problem of Second Order, Heuristic, Traveling Salesman Problem, Exact Algorithm, Assignment Problem
18	Weijian Ni, Yalou Huang, Dong Li, Yang Wang 0017	Boosting over Groups and Its Application to Acronym-Expansion Extraction.	ADMA	2008	DBLP DOI BibTeX RDF	Acronym Extraction, Classification, Boosting
18	Jun Long, Jianping Yin, En Zhu	An Active Learning Method Based on Most Possible Misclassification Sampling Using Committee.	MDAI	2007	DBLP DOI BibTeX RDF
18	James Atlas, Keith Decker	A complete distributed constraint optimization method for non-traditional pseudotree arrangements.	AAMAS	2007	DBLP DOI BibTeX RDF	distributed constraint satisfaction and optimization, multiagent coordination
18	Günther R. Raidl, Gabriele Koller, Bryant A. Julstrom	Biased Mutation Operators for Subgraph-Selection Problems.	IEEE Trans. Evol. Comput.	2006	DBLP DOI BibTeX RDF
18	Prasad A. Kulkarni, David B. Whalley, Gary S. Tyson, Jack W. Davidson	In search of near-optimal optimization phase orderings.	LCTES	2006	DBLP DOI BibTeX RDF	genetic algorithms, exhaustive search, phase ordering
18	Wensheng Wu, AnHai Doan, Clement T. Yu	WebIQ: Learning from the Web to Match Deep-Web Query Interfaces.	ICDE	2006	DBLP DOI BibTeX RDF
18	Ateet Bhalla, Inês Lynce, José T. de Sousa, João Marques-Silva 0001	Heuristic-Based Backtracking Relaxation for Propositional Satisfiability.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF
18	Kihoon Yoon, Stephen Kwek	An Unsupervised Learning Approach to Resolving the Data Imbalanced Issue in Supervised Learning Problems in Functional Genomics.	HIS	2005	DBLP DOI BibTeX RDF
18	Matthieu Basseur, Julien Lemesre, Clarisse Dhaenens, El-Ghazali Talbi	Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem.	WEA	2004	DBLP DOI BibTeX RDF
18	Yair Bartal, Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Ron Lavi, Jirí Sgall, Tomás Tichý	Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs.	STACS	2004	DBLP DOI BibTeX RDF
18	Cormac Gebruers, Alessio Guerri	Machine Learning for Portfolio Selection Using Structure at the Instance Level.	CP	2004	DBLP DOI BibTeX RDF
18	Hadas Shachnai, Tami Tamir	Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
18	Satoshi Fujita, Masayuki Masukawa, Shigeaki Tagashira	A Fast Branch-and-Bound Scheme for the Multiprocessor Scheduling Problem with Communication Time.	ICPP Workshops	2003	DBLP DOI BibTeX RDF	lower bound on the execution time, Branch-and-bound algorithm, communication time, multiprocessor scheduling problem
18	Gregory B. Sorkin	Some Notes on Random Satisfiability.	SAGA	2001	DBLP DOI BibTeX RDF
18	Yuhsuke Itoh, Makoto Haraguchi	Conceptual Classifications Guided by a Concept Hierarchy.	ALT	2000	DBLP DOI BibTeX RDF
18	Aparna Lakshmi Ratan, Oded Maron, W. Eric L. Grimson, Tomás Lozano-Pérez	A Framework for Learning Query Concepts in Image Classification.	CVPR	1999	DBLP DOI BibTeX RDF	Learning and Vision, Image Database Indexing, Digital and Video Libraries
18	Juraj Hromkovic	Stability of Approximation Algorithms for Hard Optimization Problems.	SOFSEM	1999	DBLP DOI BibTeX RDF
18	Ulrich Kohlenbach	Elimination of Skolem functions for monotone formulas in analysis.	Arch. Math. Log.	1998	DBLP DOI BibTeX RDF	Mathematics Subject Classification: 03F35, 03F10, 03F03, 03F25
18	Tetsuro Katayama, Zengo Furukawa, Kazuo Ushijima	A Test-case Generation Method for Concurrent Programs Including Task-types.	APSEC	1997	DBLP DOI BibTeX RDF
16	Chaofeng Sha, Zhen Xu, Xiaoling Wang, Aoying Zhou	Directly Identify Unexpected Instances in the Test Set by Entropy Maximization.	APWeb/WAIM	2009	DBLP DOI BibTeX RDF
16	William Klement, Peter A. Flach, Nathalie Japkowicz, Stan Matwin	Cost-Based Sampling of Individual Instances.	Canadian AI	2009	DBLP DOI BibTeX RDF	Cost-Based Learning, Sampling, Class Imbalance
16	Jeffrey Partyka, Latifur Khan, Bhavani Thuraisingham	Semantic Schema Matching without Shared Instances.	ICSC	2009	DBLP DOI BibTeX RDF
16	Stefano Brocchi, Andrea Frosini, Simone Rinaldi	Solving Some Instances of the 2-Color Problem.	DGCI	2009	DBLP DOI BibTeX RDF	k-color problem, polynomial time algorithm, Discrete tomography
16	Rita Sá, Joana Sá, Eduardo Raon	Instances of commediation.	SIGGRAPH ASIA Art Gallery & Emerging Technologies	2009	DBLP DOI BibTeX RDF