• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 20,384
Next 10 →

Search-based approaches for software development effort estimation

by Federica Sarro, Via Ponte Don Melillo - in Proceedings of the 12th International Conference on Product Focused Software Development and Process Improvement, Profes ’11 , 2011
"... In the last years the use of Search-Based techniques has been suggested to estimate software development effort. These techniques are meta-heuristics able to find optimal or near optimal solutions to problems characterized by large space. In the context of effort estimation Search-Based approaches c ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
In the last years the use of Search-Based techniques has been suggested to estimate software development effort. These techniques are meta-heuristics able to find optimal or near optimal solutions to problems characterized by large space. In the context of effort estimation Search-Based approaches

Search Based Approaches to Component Selection and

by Prioritization For The, Paul Baker, Mark Harman, Kathleen Steinhöfel, Alexandros Skaliotis
"... This paper addresses the problem of determining the next set of releases in the course of software evolution. It formulates both ranking and selection of candidate software components as a series of feature subset selection problems to which search based software engineering can be applied. The appr ..."
Abstract - Cited by 21 (11 self) - Add to MetaCart
This paper addresses the problem of determining the next set of releases in the course of software evolution. It formulates both ranking and selection of candidate software components as a series of feature subset selection problems to which search based software engineering can be applied

Search-based Approaches to the Component Selection and Prioritization Problem

by Mark Harman, Alexandros Skaliotis, Kathleen Steinhöfel - In Proceedings of the 8th annual Conference on Genetic and Evolutionary Computation (GECCO ’06 , 2006
"... This poster paper addresses the problem of choosing sets of software components to combine in component–based software engineering. It formulates both ranking and selection problems as feature subset selection problems to which search based software engineering can be applied. We will consider selec ..."
Abstract - Cited by 7 (2 self) - Add to MetaCart
This poster paper addresses the problem of choosing sets of software components to combine in component–based software engineering. It formulates both ranking and selection problems as feature subset selection problems to which search based software engineering can be applied. We will consider

Flexible Search-Based Approach for Morphological Shape Decomposition

by Joseph M. Reinhardt, William E. Higgins - in Proc. SPIE Conf. Visual Comm , 1993
"... Mathematical morphology is well-suited to capturing geometric information. Hence, morphology-based approaches have been popular for object shape representation. The two primary morphology-based approaches, the morphological skeleton and the morphological shape decomposition (MSD), each represent an ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
an object as a collection of disjoint sets. A practical shape representation scheme, though, should give a representation that is computationally efficient to use. Unfortunately, little work has been done for the morphological skeleton and the MSD to address efficiency. We propose a flexible search-based

A Search Based Approach for Overlapping Concept Boundaries

by Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahdavi
"... This paper presents techniques to integrate boundary overlap into concept assignment using Plausible Reasoning. Heuristic search techniques such as Hill climbing and Genetic Algorithms are investigated. A new fitness measure appropriate for overlapping concept assignment is introduced. The new algor ..."
Abstract - Cited by 5 (3 self) - Add to MetaCart
algorithms are compared to randomly generated results and the Genetic Algorithm is shown to be the best of the proposed search algorithms in terms of the quality of concept binding, as measured by the fitness function. The fixed boundary Hypothesis Based Concept Assignment technique is compared to the new

Microarray image gridding with stochastic search based approaches

by Giuliano Antoniol , Michele Ceccarelli - Image and Vison Computing , 2007
"... Abstract The paper reports a novel approach for the problem of automatic gridding in Microarray images. Such problem often requires human intervention; therefore, the development of automated procedures is a fundamental issue for large-scale functional genomic experiments involving many microarray ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
Abstract The paper reports a novel approach for the problem of automatic gridding in Microarray images. Such problem often requires human intervention; therefore, the development of automated procedures is a fundamental issue for large-scale functional genomic experiments involving many microarray

Negotiation of Service Level Agreements: An Architecture and a Search-Based Approach

by Elisabetta Di Nitto , Massimiliano Di Penta , Alessio Gambi , Gianluca Ripa , Maria Luisa Villani - Springer-Verlag Berlin Heidelberg, ICSOC 2007, LNCS 4749 , 2007
"... Abstract. Software systems built by composing existing services are more and more capturing the interest of researchers and practitioners. The envisaged long term scenario is that services, offered by some competing providers, are chosen by some consumers and used for their own purpose, possibly, i ..."
Abstract - Cited by 14 (2 self) - Add to MetaCart
and offers a search-based algorithm to assist the negotiating parts in the achievement of an agreement.

Efficient Model Evaluation in the Search-Based Approach to Latent Structure Discovery

by Tao Chen, Nevin L. Zhang, Yi Wang
"... Latent tree (LT) models are tree-structured Bayesian networks where leaf nodes are observed while internal nodes are hidden. We are interested in learning LT models through systematic search. A key problem here is how to efficiently evaluate candidate models during search. The problem is difficult b ..."
Abstract - Cited by 10 (7 self) - Add to MetaCart
into two distinct approaches. The first is based on data completion, while the second is based on what we call maximum restricted likelihood. We investigate and compare the two approaches in the framework of EAST, a newly developed search procedure for learning LT models. 1

A Search-Based Approach for Bayesian Inference of the T-cell Signaling Network

by Mitchell Koch, Bradley Broom, Devika Subramanian
"... Abstract—We apply a search-based technique for learn-ing high-quality Bayesian networks from proteomic flow-cytometry data for a portion of the human T-cell sig-naling network. Although Bayesian network models have been learned from this data [1], [2], [3] using Markov Chain Monte Carlo (MCMC) metho ..."
Abstract - Add to MetaCart
Abstract—We apply a search-based technique for learn-ing high-quality Bayesian networks from proteomic flow-cytometry data for a portion of the human T-cell sig-naling network. Although Bayesian network models have been learned from this data [1], [2], [3] using Markov Chain Monte Carlo (MCMC

A Search-Based Approach for Dynamically Re-packaging Downloadable Applications

by Thierry Bodhuin, Massimiliano Di Penta, Luigi Troiano
"... Mechanisms such as Java Web Start enable on-thefly downloading and execution of applications installed on remote servers, without the need for having them installed on the local machine. The rapid diffusion of mobile devices (e.g., Personal Device Assistants- PDAs) connected to the Internet make the ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
these applications appealing to mobile users. However, in many cases the available bandwidth is limited, and its excessive usage can even be a cost when wireless connections are paid on a Kbyte transfer basis. This paper proposes an approach based on Genetic Algorithms and an environment that, based on previous
Next 10 →
Results 1 - 10 of 20,384
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University