Sciweavers

1322 search results - page 130 / 265
» Parameterized counting problems
Sort
View
ISVLSI
2007
IEEE
151views VLSI» more  ISVLSI 2007»
14 years 4 months ago
Design of a MCML Gate Library Applying Multiobjective Optimization
In this paper, the problem of sizing MOS Current Mode Logic (MCML) circuits is addressed. The Pareto front is introduced as a useful analysis tool to explore the design space of e...
Roberto Pereira-Arroyo, Pablo Alvarado-Moya, Wolfg...
ACCV
2007
Springer
14 years 4 months ago
Conic Fitting Using the Geometric Distance
We consider the problem of fitting a conic to a set of 2D points. It is commonly agreed that minimizing geometrical error, i.e. the sum of squared distances between the points and...
Peter F. Sturm, Pau Gargallo
IWINAC
2007
Springer
14 years 4 months ago
Gaining Insights into Laser Pulse Shaping by Evolution Strategies
Abstract. We consider the numerical evolutionary optimization of dynamic molecular alignment by shaped femtosecond laser pulses. We study a simplified model of this quantum contro...
Ofer M. Shir, Joost N. Kok, Thomas Bäck, Marc...
SAS
2004
Springer
105views Formal Methods» more  SAS 2004»
14 years 3 months ago
Type Inference Against Races
Abstract. The race condition checker rccjava uses a formal type system to statically identify potential race conditions in concurrent Java programs, but it requires programmer-supp...
Cormac Flanagan, Stephen N. Freund
SAT
2004
Springer
101views Hardware» more  SAT 2004»
14 years 3 months ago
Detecting Backdoor Sets with Respect to Horn and Binary Clauses
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider