Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

Feasible region

Known as: Solution Space, Feasible set (optimization), Space (disambiguation) 
In mathematical optimization, a feasible region, feasible set, search space, or solution space is the set of all possible points (sets of values of… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
  • M. Laguna
  • Handbook of Heuristics
  • 2018
  • Corpus ID: 2867322
From the Publisher: This book explores the meta-heuristics approach called tabu search, which is dramatically changing our… Expand
  • table 1.1
  • figure 1.1
  • figure 1.2
  • figure 2.2
  • table 2.1
Review
2005
Review
2005
Schema and ontology matching is a critical problem in many application domains, such as semantic web, schema/ontology integration… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Review
2005
Review
2005
Data replication is a key technology in distributed systems that enables higher availability and performance. This article… Expand
  • figure 1
  • table 1
  • figure 3
  • figure 2
  • figure 4
Highly Cited
2004
Highly Cited
2004
Distributed denial-of-service (DDoS) is a rapidly growing problem. The multitude and variety of both the attacks and the defense… Expand
  • figure 1
  • figure 2
Highly Cited
2002
Highly Cited
2002
Data on individuals and entities are being collected widely. These data can contain information that explicitly identifies the… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Highly Cited
2002
Highly Cited
2002
We propose PSFQ (Pump Slowly, Fetch Quickly), a reliable transport protocol suitable for a new class of reliable data… Expand
Review
2001
Review
2001
Abstract. Schema matching is a basic problem in many database application domains, such as data integration, E-business, data… Expand
  • table 1
  • table 2
  • figure 2
  • figure 3
  • table 3
Highly Cited
1999
Highly Cited
1999
In the near future, many personal electronic devices will be able to communicate with each other over a short range wireless… Expand
Highly Cited
1997
Highly Cited
1997
Variable neighborhood search (VNS) is a metaheuristic for solving combinatorial and global optimization problems whose basic idea… Expand
  • table 6.2
Highly Cited
1986
Highly Cited
1986
We describe how several optimization problems can be rapidly solved by highly interconnected networks of simple analog processors… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5