Sciweavers

13 search results - page 2 / 3
» Boolean Minimizer FC-Min: Coverage Finding Process
Sort
View
TASE
2010
IEEE
13 years 1 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
JAR
2008
81views more  JAR 2008»
13 years 7 months ago
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable "cores" from unsatisfiable constraint systems with the goal...
Mark H. Liffiton, Karem A. Sakallah
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 7 months ago
Mining The Successful Binary Combinations: Methodology and A Simple Case Study
The importance of finding the characteristics leading to either a success or a failure is one of the driving forces of data mining. The various application areas of finding succes...
Yuval Cohen
ICCAD
2009
IEEE
147views Hardware» more  ICCAD 2009»
13 years 4 months ago
SAT-based protein design
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...
AAAI
2010
13 years 7 months ago
Computing Cost-Optimal Definitely Discriminating Tests
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...
Anika Schumann, Jinbo Huang, Martin Sachenbacher