Results 1  10
of
292,878
The Feasible Solution Space for Steiner Trees
 PROCEEDINGS OF THE EIGHTH SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS CONFERENCE ON DISCRETE MATHEMATICS
, 1996
"... Since many optimization problems seem to require exponential time to find maxima or minima, much time and effort has been spent in attempting to diminish the size of feasible solution spaces for these problems in order to speed up the search for optimum solutions. We begin with a feasible soluti ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Since many optimization problems seem to require exponential time to find maxima or minima, much time and effort has been spent in attempting to diminish the size of feasible solution spaces for these problems in order to speed up the search for optimum solutions. We begin with a feasible
Molecular Computation Of Solutions To Combinatorial Problems
, 1994
"... The tools of molecular biology are used to solve an instance of the directed Hamiltonian path problem. A small graph is encoded in molecules of DNA and the `operations' of the computation are performed with standard protocols and enzymes. This experiment demonstrates the feasibility of carrying ..."
Abstract

Cited by 773 (6 self)
 Add to MetaCart
The tools of molecular biology are used to solve an instance of the directed Hamiltonian path problem. A small graph is encoded in molecules of DNA and the `operations' of the computation are performed with standard protocols and enzymes. This experiment demonstrates the feasibility
Greedy Randomized Adaptive Search Procedures
, 2002
"... GRASP is a multistart metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phas ..."
Abstract

Cited by 647 (82 self)
 Add to MetaCart
GRASP is a multistart metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search
Improved feasible solution algorithms for high breakdown estimation
 Computational Statistics and Data Analysis
, 1999
"... High breakdown estimation allows one to get reasonable estimates of the parameters from a sample of data even if that sample is contaminated by large numbers of awkwardly placed outliers. Two particular application areas in which this is of interest are multiple linear regression, and estimation of ..."
Abstract

Cited by 22 (6 self)
 Add to MetaCart
determinant (MCD). All of these present daunting computational problems. The ‘feasible solution algorithms ’ for these criteria have been shown to have excellent performance for textbook sized problems, but their performance on much larger data sets is less impressive. This paper points out a computationally
On agentbased software engineering
 ARTIFICIAL INTELLIGENCE
, 2000
"... Agentoriented techniques represent an exciting new means of analysing, designing and building complex software systems. They have the potential to significantly improve current practice in software engineering and to extend the range of applications that can feasibly be tackled. Yet, to date, there ..."
Abstract

Cited by 632 (26 self)
 Add to MetaCart
Agentoriented techniques represent an exciting new means of analysing, designing and building complex software systems. They have the potential to significantly improve current practice in software engineering and to extend the range of applications that can feasibly be tackled. Yet, to date
Cluster Ensembles  A Knowledge Reuse Framework for Combining Multiple Partitions
 Journal of Machine Learning Research
, 2002
"... This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that determined these partitionings. We first identify several application scenarios for the resultant 'knowledge reuse&ap ..."
Abstract

Cited by 603 (20 self)
 Add to MetaCart
clustering. Due to the low computational costs of our techniques, it is quite feasible to use a supraconsensus function that evaluates all three approaches against the objective function and picks the best solution for a given situation. We evaluate the effectiveness of cluster ensembles in three
Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #Pcomplete
 Discrete Applied Mathematics
"... Deciding whether or not a feasible solution to the Traveling Salesman Problem with Pickups and Deliveries (TSPPD) exists is polynomially solvable. We prove that counting the number of feasible solutions of the TSPPD is hard by showing the problem is #Pcomplete. ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Deciding whether or not a feasible solution to the Traveling Salesman Problem with Pickups and Deliveries (TSPPD) exists is polynomially solvable. We prove that counting the number of feasible solutions of the TSPPD is hard by showing the problem is #Pcomplete.
Convex Position Estimation in Wireless Sensor Networks
"... A method for estimating unknown node positions in a sensor network based exclusively on connectivityinduced constraints is described. Known peertopeer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem fo ..."
Abstract

Cited by 493 (0 self)
 Add to MetaCart
A method for estimating unknown node positions in a sensor network based exclusively on connectivityinduced constraints is described. Known peertopeer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem
Articulated pose estimation in a learned smooth space of feasible solutions
 IN: WORSHOP ON LEARNING IN COMPUTER VISION AND PATTERN RECOGNITION
, 2005
"... A learning based framework is proposed for estimating human body pose from a single image. Given a differentiable function that maps from pose space to image feature space, the goal is to invert the process: estimate the pose given only image features. The inversion is an illposed problem as the in ..."
Abstract

Cited by 40 (3 self)
 Add to MetaCart
as the inverse mapping is a one to many process, hence multiple solutions exist. It is desirable to restrict the solution space to a smaller subset of feasible solutions. The space of feasible solutions may not admit a closed form description. The proposed framework seeks to learn an approximation over such a
Tracking Vehicles with GPS: Is it a Feasible Solution?
"... Global Positioning Systems (GPS) is widely used in tracking vehicles and is superior to conventional technologies based on certain important criteria. This article investigates the feasibility of tracking vehicles with regular GPS devices. Since downtown is generally the “heart ” of a city with high ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Global Positioning Systems (GPS) is widely used in tracking vehicles and is superior to conventional technologies based on certain important criteria. This article investigates the feasibility of tracking vehicles with regular GPS devices. Since downtown is generally the “heart ” of a city
Results 1  10
of
292,878