Sciweavers

1144 search results - page 45 / 229
» Feasibility Studies
Sort
View
JEA
2010
94views more  JEA 2010»
13 years 3 months ago
Layer-free upward crossing minimization
An upward drawing of a DAG G is a drawing of G in which all edges are drawn as curves increasing monotonically in the vertical direction. In this paper, we present a new approach f...
Markus Chimani, Carsten Gutwenger, Petra Mutzel, H...
TEC
2010
126views more  TEC 2010»
13 years 3 months ago
Learning the Large-Scale Structure of the MAX-SAT Landscape Using Populations
A new algorithm for solving MAX-SAT problems is introduced which clusters good solutions, and restarts the search from the closest feasible solution to the centroid of each cluster...
Mohamed Qasem, Adam Prügel-Bennett
DAC
2007
ACM
14 years 22 days ago
Verification Methodologies in a TLM-to-RTL Design Flow
SoC based system developments commonly employ ESL design ogies and utilize multiple levels of abstract models to provide feasibility study models for architects and development pl...
Atsushi Kasuya, Tesh Tesfaye
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 6 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
AIPS
2006
13 years 10 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley