Sciweavers

16082 search results - page 2807 / 3217
» Algorithms for Marketing-Mix Optimization
Sort
View
238
Voted
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
16 years 7 hour ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
234
Voted
PG
1999
IEEE
15 years 12 months ago
Automatic Creation of Object Hierarchies for Radiosity Clustering
Using object clusters for hierarchical radiosity greatly improves the efficiency and thus usability of radiosity computations. By eliminating the quadratic starting phase very lar...
Gordon Müller, Stephan Schäfer, Dieter W...
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
15 years 12 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani
205
Voted
ICSM
1994
IEEE
15 years 11 months ago
A Framework for Partial Data Flow Analysis
Although data pow analysis was first developed for use in compilers, its usefulness is now recognized in many software tools. Because of its compiler origins, the computation of d...
Rajiv Gupta, Mary Lou Soffa
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 11 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
« Prev « First page 2807 / 3217 Last » Next »