Sciweavers

398 search results - page 6 / 80
» A new biclustering technique based on crossing minimization
Sort
View
SAT
2010
Springer
125views Hardware» more  SAT 2010»
13 years 11 months ago
Two Techniques for Minimizing Resolution Proofs
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
Scott Cotton
FPL
2008
Springer
104views Hardware» more  FPL 2008»
13 years 9 months ago
A technique for minimizing power during FPGA placement
This paper considers the implementation of an annealing technique for dynamic power reduction in FPGAs. The proposed method comprises a power-aware objective function for placemen...
Kristofer Vorwerk, Madhu Raman, Julien Dunoyer, Ya...
INFORMS
2010
147views more  INFORMS 2010»
13 years 4 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
MICCAI
2000
Springer
13 years 11 months ago
Modifying Soft Tissue Models: Progressive Cutting with Minimal New Element Creation
Surgical simulation is a promising technology for training medical students and planning procedures. One major requirement for these simulation systems is a method to generate real...
Andrew B. Mor, Takeo Kanade
MP
2010
116views more  MP 2010»
13 years 5 months ago
New techniques for cost sharing in combinatorial optimization games
Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for...
Alberto Caprara, Adam N. Letchford