Sciweavers

8647 search results - page 659 / 1730
» The Container Selection Problem
Sort
View
IJCAI
1989
15 years 8 months ago
Reasoning About Assumptions in Graphs of Models
Solving design and analysis problems in physical worlds requires the representatio n of large amounts of knowledge. Recently, there has been much interest in explicitly making ass...
Sanjaya Addanki, Roberto Cremonini, J. Scott Penbe...
IJCAI
1989
15 years 8 months ago
Rapid Retrieval Algorithms for Case-Based Reasoning
One of the major issues confronting case-based reasoning (CBR) is rapid retrieval of similar cases from a large case base. This paper describes three algorithms which address this...
Richard H. Stottler, Andrea L. Henke, James A. Kin...
ETS
2010
IEEE
150views Hardware» more  ETS 2010»
15 years 8 months ago
Improving CNF representations in SAT-based ATPG for industrial circuits using BDDs
It was shown in the past that ATPG based on the Boolean Satisfiability problem is a beneficial complement to traditional ATPG techniques. Its advantages can be observed especially ...
Daniel Tille, Stephan Eggersglüß, Rene ...
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
15 years 7 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
DAM
2010
167views more  DAM 2010»
15 years 7 months ago
A new characterization of P6-free graphs
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
Pim van 't Hof, Daniël Paulusma